| 邻接树图是哈密尔顿图猜想的一个等价命题 |
| |
| 引用本文： | 张兰菊. 邻接树图是哈密尔顿图猜想的一个等价命题[J]. 应用数学, 2000, 13(4): 124-129 |
| |
| 作者姓名： | 张兰菊 |
| |
| 作者单位： | 山东大学数学院，济南 山东 250100 |
| |
| 基金项目： | This work is supported byNNSF of China(69772017)RFDP of Higher Education(97042207) |
| |
| 摘 要： | 本文给出了简单图的邻接树图是哈密尔顿图”猜想的等价命题，阐明只需证明该猜想对2－连通图成立即可，另外，我们给出了该猜想一种特殊情形的构造性证明。
|
| 关 键 词： | 邻接树图 哈密尔顿图猜想 等价命题 简单图 |
| 文章编号： | 1001-9847(2000)04-0124-06 |
| 修稿时间： | 2000-08-15 |
An Equivalent Proposition to the Conjecture on the Hamiltonicity of Adjacency Tree Graphs |
| |
| ZHANG Lan-ju. An Equivalent Proposition to the Conjecture on the Hamiltonicity of Adjacency Tree Graphs[J]. Mathematica Applicata, 2000, 13(4): 124-129 |
| |
| Authors: | ZHANG Lan-ju |
| |
| 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. |
| |
| Keywords: | Adjacency tree graph Hamilton cycle |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
