Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers 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 Dirac's theorem on Hamiltonian cycles only apply for undirected graphs? If the theorem applied to directed graphs, the graph with the following adjacency list should have a Hamiltonian cycle, but I can't find one.

$0$: $1$ $2$ $3$

$1$: $2$ $3$

$2$: $1$ $3$

$3$: $1$ $2$

share|cite|improve this question
Yes Dirac Theorem is for undirected graphs, directed variation is this(is not by dirac): If $G$ is a strongly connected graph and $\delta^+(G)+\delta^-(G) \ge n$. $\delta^+(G)$ is minimum out degree and $\delta^-(G)$ is minimum in degree of $G$. – Saeed Apr 23 '14 at 20:56
up vote 10 down vote accepted

While Dirac's theorem wasn't intended/proved for directed graphs, it was extended to directed graphs by GHOUILA-HOURI in 1960 ("Une condition suffisante d’existence d'un circuit hamiltonien").

Their requirements, however, were that each vertex should have both out-degree and in-degree of at least $n/2$, which is not the case in your graph.

One of the original conditions of GHOUILA-HOURI, as Saeed mentioned, is that the graph is strongly connected. In fact, the degree conditions are strong enough for only diameter $\leq 2$ graphs to be considered.

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.