| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648583 | Discrete Mathematics | 2009 | 8 Pages |
Abstract
In this paper, we prove that every 3-connected claw-free graph GG on nn vertices contains a cycle of length at least min{n,6δ−15}{n,6δ−15}, thereby generalizing several known results.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
MingChu Li, Yongrui Cui, Liming Xiong, Yuan Tian, He Jiang, Xu Yuan,