| Hamiltonian[k,k+1]-因子 |
| |
| 引用本文： | 蔡茂诚,方奇志,李延军. Hamiltonian[k,k+1]-因子[J]. 数学进展, 2003, 32(6): 722-726 |
| |
| 作者姓名： | 蔡茂诚 方奇志 李延军 |
| |
| 作者单位： | 1. 中国科学院系统科学研究所,北京,100080,中国
2. 青岛海洋大学数学系,青岛,山东,266071,中国 |
| |
| 基金项目： | Supportecl by Youth Science Foundation if National University of Defence Technology |
| |
| 摘 要： | 本文考虑n/2-临界图中Hamiltonian[k,k+1]-因子的存在性。Hamiltonian[k,k+1]-因子是指包含Hamiltonian圈的[k,k+1]-因子;给定阶数为n的简单图G,若δ(G)≥n/2而δ(Ge)
|
| 关 键 词： | n／2-临界图 Hamiltonian[k，k＋1]-因子 存在性 Hamiltonian圈 简单图 |
Hamiltonian [k, k + 1]-Factor |
| |
| CAI Mao-cheng,FANG Qi-zhi,LI Yan-jun. Hamiltonian [k, k + 1]-Factor[J]. Advances in Mathematics(China), 2003, 32(6): 722-726 |
| |
| Authors: | CAI Mao-cheng FANG Qi-zhi LI Yan-jun |
| |
| Abstract: | A Hamiltonian [k, k + 1]-factor is a [k, k + 1]-factor containing a Hamiltonian cycle. A simple graph G of order n is n/2-critical if δ(G) ≥ n/2 but δ(G - e) ＜ n/2 for any edge e ∈ E(G). Let k ≥ 2 be an integer and G be an n/2-critical graph with n ≥ 4k - 6 and n ≥ 7. In this paper it is proved that for any given Hamiltonian cycle C of G, G has a [k, k + 1]-factor containing C. This result is an improvement on some recent results about the existence of Hamiltonian [k, k + 1]-factor. |
| |
| Keywords: | n/2-critical graph [k k+1]-factor Hamiltonian cycle Hamiltonian [k k+1]-factor |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
