diff -r a3402913cffe -r f63e87b9748e lemon/euler.h
--- a/lemon/euler.h	Sat Apr 18 21:54:30 2009 +0200
+++ b/lemon/euler.h	Tue Apr 21 10:34:49 2009 +0100
@@ -24,7 +24,7 @@
 #include<lemon/connectivity.h>
 #include <list>
 
-/// \ingroup graph_prop
+/// \ingroup graph_properties
 /// \file
 /// \brief Euler tour
 ///
@@ -36,7 +36,7 @@
 
   ///Euler iterator for digraphs.
 
-  /// \ingroup graph_prop
+  /// \ingroup graph_properties
   ///This iterator converts to the \c Arc type of the digraph and using
   ///operator ++, it provides an Euler tour of a \e directed
   ///graph (if there exists).
@@ -123,7 +123,7 @@
 
   ///Euler iterator for graphs.
 
-  /// \ingroup graph_prop
+  /// \ingroup graph_properties
   ///This iterator converts to the \c Arc (or \c Edge)
   ///type of the digraph and using
   ///operator ++, it provides an Euler tour of an undirected
@@ -228,7 +228,7 @@
 
   ///Checks if the graph is Eulerian
 
-  /// \ingroup graph_prop
+  /// \ingroup graph_properties
   ///Checks if the graph is Eulerian. It works for both directed and undirected
   ///graphs.
   ///\note By definition, a digraph is called \e Eulerian if