The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs
The Planar Hamiltonian Circuit Problem is NP-Complete