A Hamiltonian Cycle is a simple cycle in a graph going through each vertex exactly once.

HC = { G G has a Hamiltonian cycle}

HC NPC

Proof: