应用数学2000，Vol.13Issue(4)：124-129,6.
邻接树图是哈密尔顿图猜想的一个等价命题
An Equivalent Proposition to the Conjecture on the Hamiltonicity of Adjacency Tree Graphs
摘要
Abstract
This paper presents an equivalent proposition of a conjecture stating that the adjacency tree graph of a simple graph is Hamiltonian. This proposition shows that we can restrict the simple graph in the conjectture to a block. Moreover, the conjecture in the case of a block with cyclomatic number 2 is confirmed by constructing a Hamilton cycle.关键词
邻接树图/哈密尔顿图Key words
Adjacency tree graph/Hamilton cycle分类
数理科学引用本文复制引用
张兰菊..邻接树图是哈密尔顿图猜想的一个等价命题[J].应用数学,2000,13(4):124-129,6.基金项目
This work is supported by NNSF of China(69772017)RFDP of Higher Education(97042207) （69772017）
