The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs.

Norishige Chiba Takao Nishizeki The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs. 187-211 1989 10 J. Algorithms 2 db/journals/jal/jal10.html#ChibaN89