diff --git a/doc/cuthill_mckee_ordering.html b/doc/cuthill_mckee_ordering.html
index aa176270..f5d7c110 100644
--- a/doc/cuthill_mckee_ordering.html
+++ b/doc/cuthill_mckee_ordering.html
@@ -44,24 +44,24 @@
             class ColorMap, class DegreeMap>
   OutputIterator
   cuthill_mckee_ordering(const IncidenceGraph& g,
-                         typename graph_traits<Graph>::vertex_descriptor s,
+                         typename graph_traits<IncidenceGraph>::vertex_descriptor s,
                          OutputIterator inverse_permutation, 
                          ColorMap color, DegreeMap degree)
 
   (2)
   template <class VertexListGraph, class OutputIterator>
   OutputIterator
-  cuthill_mckee_ordering(const VertexIndexMap& G, OutputIterator inverse_permutation); 
+  cuthill_mckee_ordering(const VertexListGraph& g, OutputIterator inverse_permutation); 
 
   template <class VertexListGraph, class OutputIterator, class VertexIndexMap>
   OutputIterator
-  cuthill_mckee_ordering(const VertexIndexMap& G, OutputIterator inverse_permutation, 
+  cuthill_mckee_ordering(const VertexListGraph& g, OutputIterator inverse_permutation, 
                          VertexIndexMap index_map); 
  
   template <class VertexListGraph, class OutputIterator, 
             class ColorMap, class DegreeMap>
   OutputIterator
-  cuthill_mckee_ordering(const VertexListGraph& G, OutputIterator inverse_permutation, 
+  cuthill_mckee_ordering(const VertexListGraph& g, OutputIterator inverse_permutation, 
                          ColorMap color, DegreeMap degree)
                          
   (3)
@@ -70,7 +70,7 @@
   OutputIterator
   cuthill_mckee_ordering(const IncidenceGraph& g,
     			 std::deque< typename
-			 graph_traits<Graph>::vertex_descriptor > vertex_queue,
+			 graph_traits<IncidenceGraph>::vertex_descriptor > vertex_queue,
                          OutputIterator inverse_permutation, 
                          ColorMap color, DegreeMap degree)
 </pre>
@@ -172,7 +172,7 @@ For version 2:
 
 <li> <tt>VertexListGraph&amp; g</tt> &nbsp;(IN) <br> 
   An undirected graph. The graph's type must be a model of <a
-  href="./VertexListGraph.html">VertexListGraph</a>.<br>
+                                                              href="./VertexListGraph.html">VertexListGraph</a> and <a href="./IncidenceGraph.html">IncidenceGraph</a>.<br>
   <b>Python</b>: The parameter is named <tt>graph</tt>.
 
 <li> <tt><a href="http://www.sgi.com/tech/stl/OutputIterator.html">