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.