1

Does the graph with only one vertex have an Eulerian path? And, does it have a Hamiltonian path?

Cosmo Harrigan
  • 113
eouti
  • 171
  • 1
    I don't know if everyone defines it the same way, but Diestel's book, at least, allows a path to consist of a single vertex, which means that the answer is yes. – Andrew Uzzell Dec 12 '12 at 14:48
  • @Andrew: You could post that as an answer so the question doesn't remain unanswered. – joriki Dec 12 '12 at 17:34

1 Answers1

4

I'm not sure if all graph theory books treat degenerate cases the same way, but Diestel's Graph Theory, at least, allows a path to have length $0$, i.e., to consist of a single vertex with no edges. If a graph consists of a single vertex $v$, then the path consisting of $v$ is vacuously Eulerian. It is also a Hamiltonian path, since it contains all of the vertices of the graph.

darij grinberg
  • 19,173
Andrew Uzzell
  • 1,711