I came up with this lemma that I believe to be true. But can anyone verify it?(with proof?)
Thank you so much.
Note: it is true that all vertices have an even degree.
(In a graph G)Does the existence of an eulerian circuit imply that there exist a eulerian path for any two vertices in the graph?
0
$\begingroup$
graph-theory
-
2Take a cyclic graph with 20 vertices and 20 edges. Indeed, it is its own eulerian circuit. Now good luck finding a path that starts at 1 and ends at 11. – 2017-01-27
-
0@Ivan, of course you mean an *Eulerian* path that starts at 1 and ends at 11. . – 2017-01-27
-
0Yeah, of course I mean eulerian path. – 2017-01-27