Circumferences of 3-connected claw-free graphs
Document Type
Article
Publication Date
June 2016
Publication Title
Discrete Mathematics
First Page
1640
Last Page
1650
DOI
https://doi.org/10.1016/j.disc.2016.01.018
Abstract
In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ contains a cycle of length at least min{n,6δ−15}, and they conjectured that such graphs should have a cycle of length at least min{n,9δ−3}. We prove that this conjecture is true with δ≥8.
Recommended Citation
Chen, Zhi-Hong, "Circumferences of 3-connected claw-free graphs" Discrete Mathematics 339/6 (2016): 1640-1650.
Available at https://digitalcommons.butler.edu/facsch_papers/1189
Notes
Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the article or borrow it from a local library.