1. A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs;Asano;Discrete Appl. Math.,1984
2. Computational Geometry: Algorithms and Applications;de Berg,1997
3. Graph Theory with Applications;Bondy,1976
4. P. Bose, G. Toussaint, Growing a tree from its branches, Proceedings of First Pacific Conference Computer Graphics Applications, Seoul, Korea, Vol. 1, World Scientific, Singapore, 1993, pp. 90–99.
5. Hamiltonian cycles in planar triangulations with no separating triangles;Dillencourt;J. Graph Theory,1990