Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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

share|cite|improve this question
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
up vote 2 down vote accepted

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 a path consisting of $v$ is vacuously Eulerian. It is also a Hamiltonian path, since it contains all of the vertices of the graph.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.