Definition:Hamiltonian Graph

A Hamilton cycle in a graph is a cycle that contains every vertex of the graph (but not necessarily every edge).

A Hamiltonian graph is graph that contains a Hamiltonian cycle.