一类3-正则3-连通平面Hamilton图(英文)

A Class of Hamiltonian 3-regular 3-connected Planar Graph

设Γk是由带如下结构的3-正则3-连通平面图G所组成的图类:G中含一个圈C,使得G-E(C)产生k个不相交的树,并且每个树具有至少三条边.本文证明了Γ1中所有的图都是Hamilton图.

Let Г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 Hamihonian.