A Class of Hamiltonian 3-regular 3-connected Planar Graph
Gao Tai-ping, Aimin Yang, Jianzhong Wang · 2005
Let Γ(subscript k) be the family of 3-regular 3-connected planar graphs G having a cycle C such that G-E(C) produces k disjoint trees. Each has at least three edges. In this paper, we prove that all graphs in Γ1 are Hamiltonian.