Hamiltonian graph
= Hamiltonian graph
{c}
A <Hamiltonian graph> is a <graph> containing a <Hamilton cycle>. This describes existence of a spanning <graph cycle>, rather than requiring every <edge> of the <graph> to belong to that <graph cycle>. In the finite <simple graph> convention, $K_n$ is a <Hamiltonian graph> for $n\geq3$, because any ordering of its <vertices> closes using available <edges>.