Hamilton graph | HamiltonianQ

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian graph on n nodes has graph circumference n. A graph possessing exactly one Hamiltonian cycle is known as a uniquely Hamiltonian graph.

almost Hamiltonian graph | Archimedean dual graph | Archimedean graph | Barnette's conjecture | bicubic graph | Chvátal's theorem | cyclic graph | Eulerian graph | Hamilton-connected graph | Hamiltonian cycle | Hamiltonian path | Hamiltonian walk | Herschel graph | hypohamiltonian graph | hypotraceable graph | icosian game | longest path | Meredith graph | nonhamiltonian graph | nonhamiltonian vertex-transitive graph | Ore graph | Tait's Hamiltonian graph conjecture | traceable graph | traveling salesman problem | Tutte conjecture | uniquely Hamiltonian graph