Path and Cycle Factors of Cubic Graphs

摘要：

For a set ∮ of connected graphs,a spanning subgraph F of a graph is called an ∮-factor if every component of F is isomorphic to a member of ∮.It was recently shown that every 2-connected cubic graph has a Cn｜n ≥4-factor,where Cn denote the cycle of order n.Kano et al.have conjectured that every 3connected cubic graph of order at least six has a Cn｜n ≥5-factor.In this paper,we give a proof of this conjecture.

关键词： path factor cycle factor cubic graph

作者: Cai-Feng Du

作者单位: College of Mathematics and Computational Science,China University of Petroleum,Dongying Shandong 257061,China

会议类型: 国际会议

会议名称: The 8th International Symposium on Operations Research and Its Applications(第八届运筹及其应用国际专题讨论会 ISORA09)

会议地点: 张家界

会议语种:英文

页码: 469-472

在线出版日期: 2009-09-20（万方平台首次上网日期，不代表论文的发表时间）