Topics: Graph Theory - Path


In a graph , an Eulerian path is a path that contains all the edges in exactly once.

When has such a path, we say that it is an Eulerian graph.


The following statements are equivalent for a connected graph :

  • is Eulerian
  • The degree of every vertex in is even