THE SUFFICIENT AND NECESSARY CONDITION FOR A PLANAR TO BE HAMILTONIAN
Zhou Yinliang
DOI:10.11835/j.issn.1674-4764.1988.01.013
Received ,Revised , Accepted , Available online July 01, 2015
Volume ,1988,Pages -
- Abstract
This paper presents a sufficient and necessary condition for any planarembedding G(namely plane graph)of a planar graph to be Hamiltonian.If Gis Hamiltonian,a method that an adjacent edge subgraph method for finddingits Hamilton cycles are given.