Skip to main content

For questions related to the Hamiltonicity of a graph.

A graph is Hamiltonian if it has a Hamiltonian cycle, i.e, a cycle that visits each vertex exactly once.