(with more than two vertices) is Hamiltonian if and only if it is strongly connected.

The number of different Hamiltonian cycles in a complete undirected graph on vertices is and in a complete directed graph on vertices is . These counts assume that cycles that are the same apart from their starting point are not counted separately.

Bondy-Chvátal theorem

The best vertex degree characterization of Hamiltonian

1.Previous
3.Next