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.
参考文献
相似文献
引证文献
引用本文
周寅亮.平面图是Hamilton图的充分必要条件[J].土木与环境工程学报(中英文),1988,10(1). Zhou Yinliang. THE SUFFICIENT AND NECESSARY CONDITION FOR A PLANAR TO BE HAMILTONIAN[J]. JOURNAL OF CIVIL AND ENVIRONMENTAL ENGINEERING,1988,10(1).10.11835/j. issn.1674-4764.1988.01.013