An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. - Takao Asano; Shunji Kikuchi; Nobuji Saito (Graph Theory and Algorithms, 1980)

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs. - Takao Asano; Shunji Kikuchi; Nobuji Saito (Discret. Appl. Math., 1984)