华北工学院学报2005，Vol.26Issue(4)：246-250,5.
一类3-正则3-连通平面Hamilton图
A Class of Hamiltonian 3-regular 3-connected Planar Graph
摘要
Abstract
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 areHamiltonian.关键词
Hamilton图/正则图/平面图/△-收缩图Key words
Hamiltonian graph/regular graph/planar graph/△-contraction graph分类
数理科学引用本文复制引用
高太平,杨爱民,王建中..一类3-正则3-连通平面Hamilton图[J].华北工学院学报,2005,26(4):246-250,5.基金项目
国家自然科学基金资助项目 （）
山西省自然科学基金资助项目 （）
