The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs