Article ID Journal Published Year Pages File Type
9514534 Electronic Notes in Discrete Mathematics 2005 7 Pages PDF
Abstract
In this paper, we prove that every 3-connected claw-free graph on n vertices contain a cycle of length at least min{n,6δ−17}, hereby improving several known results.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
Authors
, ,