Hamilton cycle

A cycle visiting every vertex exactly once. Deciding existence is NP-complete in general; many sufficient conditions (Dirac, Ore).