Takao Asano, S. Kikuchi, Nobuji Saito. An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. In Nobuji Saito, Takao Nishizeki, editors, Graph Theory and Algorithms, 17th Symposium of Research Institute of Electric Communication, Tohoku University, Sendai, Japan, October 24-25, 1980, Proceedings. Volume 108 of Lecture Notes in Computer Science, pages 182-195, Springer, 1980.
Abstract is missing.