机构:
Chongqing Technol & Business Univ, Coll Sci, Chongqing 400067, Peoples R ChinaChongqing Technol & Business Univ, Coll Sci, Chongqing 400067, Peoples R China
Li, MingChu
[1
]
机构:
[1] Chongqing Technol & Business Univ, Coll Sci, Chongqing 400067, Peoples R China
[2] Dalian Univ Technol, Sch Software, Dalian 116620, Liaoning, Peoples R China
A known result obtained independently by Fan and Jung is that every 3-connected k-regular graph on n vertices contains a cycle of length at least min{3k, n}. This raises the question of how much can be said about the circumferences of 3-connected k-regular claw-free graphs. In this paper, we show that every 3-connected k-regular claw-free graph on n vertices contains a cycle of length at least min{6k - 17, n}. (c) 2006 Elsevier B.V. All rights reserved.
机构:
East China Normal Univ, Shanghai Key Lab PMMP, Dept Math, Shanghai, Peoples R ChinaEast China Normal Univ, Shanghai Key Lab PMMP, Dept Math, Shanghai, Peoples R China
Lu, Changhong
Mao, Rui
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Lixin Univ Accounting & Finance, Shanghai, Peoples R ChinaEast China Normal Univ, Shanghai Key Lab PMMP, Dept Math, Shanghai, Peoples R China
Mao, Rui
Wang, Bing
论文数: 0引用数: 0
h-index: 0
机构:
Chuzhou Univ, Sch Math & Finance, Chuzhou, Anhui, Peoples R ChinaEast China Normal Univ, Shanghai Key Lab PMMP, Dept Math, Shanghai, Peoples R China
机构:
East China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai, Peoples R ChinaEast China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai, Peoples R China
Chen, Hangdi
Lu, Changhong
论文数: 0引用数: 0
h-index: 0
机构:
East China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai, Peoples R ChinaEast China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai, Peoples R China
Lu, Changhong
Ye, Qingjie
论文数: 0引用数: 0
h-index: 0
机构:
East China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai, Peoples R ChinaEast China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai, Peoples R China