0
$\begingroup$

Euler tour is a closed walk that can traverse each edge in a graph exactly once.

If every edge in a connected undirected graph has even degree, how can you prove that it has an Euler tour?

  • 1
    The graph needs to be connected as well.2012-10-26
  • 0
    Yes, you are right. The graph is connected and undirected. I modified the post.2012-10-26

1 Answers 1