EXISTENCE OF HAMILTONIAN k-FACTOR

被引：0

作者：

CAI MaochengInstitute of Systems Science Academy of Mathmatics and Systems Science Chinese Academy ofSciences Beijing ChinaFANG Qizhi Department of Mathematics Ocean University of China Qingdao ChinaLI YanjunInstitute of Systems Science Academy of Mathematics and Systems Science Chinese Academy ofSciences Beijing China ^{[100080
,266071
,100080
]}

机构：

来源：

JournalofSystemsScienceandComplexity | 2004年 / 04期

关键词：

k-factor; Hamiltonian k-factor; Hamiltonian cycle; n/2-critical graph;

D O I：

暂无

中图分类号：

O174 [函数论];

学科分类号：

070104 ;

摘要：

<正> A Hamiltonian k-factor is a k-factor containing a Hamiltonian cycle. An n/2-critical graph G is a simple graph of order n which satisfies S(G) > n/2 and δ(G - e)< n/2 for any edge e ∈ E(G). Let k > 2 be an integer and G be an n/2-critical graph of even order n > 8k-14. It is shown in this paper that for any given Hamiltonian cycle C except that G - C consists of two components of odd orders when fc is odd, G has a k-factor containing C.

引用

页码：464 / 471

页数：8