Circumferences of regular claw-free graphs

被引：2
|
作者：
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
来源：
DISCRETE MATHEMATICS | 2006年 / 306卷 / 21期
关键词：
circumference; longest cycle; claw-free graph; regularity; 3-connectedness;
D O I：
10.1016/j.disc.2006.04.026
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：2682 / 2694
页数：13
相关论文
共 50 条
12345