The issue that should promptly spring to brain is this: if a graph is connected as well as diploma of every vertex is even, is there an Euler circuit? The solution is Of course.$begingroup$ I think I disagree with Kelvin Soh a little, in that he seems to permit a path to repeat exactly the same vertex, and I believe this isn't a common definition.