Article
Circumferences of 3-connected claw-free graphs
Discrete Mathematics
(2016)
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.
Keywords
- Circumference,
- Claw-free graph,
- Collapsible graph,
- Closed trail,
- Dominating closed trail,
- Supereulerian graph
Disciplines
Publication Date
June, 2016
DOI
https://doi.org/10.1016/j.disc.2016.01.018
Publisher Statement
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.
Citation Information
Zhi-Hong Chen. "Circumferences of 3-connected claw-free graphs" Discrete Mathematics Vol. 339 Iss. 6 (2016) p. 1640 - 1650 ISSN: 0012-365X Available at: http://works.bepress.com/zhi_hong_chen/18/