K-Factors and Hamilton Cycles in Graphs

被引：0
|
作者：
Zhi Guo Wang
Zhen Jiang Zhao
机构：
[1] He'nan University,College of Mathematics and Information Sciences
来源：
Acta Mathematica Sinica, English Series | 2007年 / 23卷
关键词：
-factor; 2-connected graph; Hamilton cycle; 05C38; 05C45;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We discuss k-factors and Hamiltonian Graphs in graph theory. We prove a general version of the conjecture by R. Haggkvist; as a result, we prove two extended versions of two well-known theorems due to O. Ore and B. Jachson, respectively.
引用
收藏
页码：309 / 312
页数：3
相关论文
共 50 条
12345