| k-因子的Hamiltonian |
| |
| 引用本文： | 王兵.k-因子的Hamiltonian[J].洛阳大学学报,2007,22(2):15-17. |
| |
| 作者姓名： | 王兵 |
| |
| 作者单位： | 枣庄学院,数学系,山东,枣庄,277160 |
| |
| 基金项目： | 国家自然科学基金资助项目（项目编号：10471078）. |
| |
| 摘 要： | 我们给出一个猜想的简短证明:如果2-连通的图G含有k-因子,且满足σ2(G)≥n-k,图G是Hamiltonian的.
|
| 关 键 词： | 坚韧 k-因子 Hamiltonian |
| 文章编号： | 1007-113X（2007）02-0015-03 |
| 修稿时间： | 2007-03-09 |
A Short Proof of A Conjecture |
| |
| WANG Bing.A Short Proof of A Conjecture[J].Journal of Luoyang University,2007,22(2):15-17. |
| |
| Authors: | WANG Bing |
| |
| Institution: | Dept of Math, Zaozhuang College, Zaozhuang 277160, China |
| |
| Abstract: | We give a new short proof of a conjecture: Let G be a 2-connected graph on n vertices where every pair of nonadjacent vertices has degree sum at least n-k and assume furthermore that G has a k-factor,then G is Hamiltonian. |
| |
| Keywords: | t-tough k-factor Hamiltonian |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
