Hamiltonian Graph

A graph where a single path can visit every vertex exactly once.