Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs

Ming Chu Li*, Liming Xiong

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

摘要

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.

源语言英语
页(从-至)93-99
页数7
期刊Electronic Notes in Discrete Mathematics
22
DOI
出版状态已出版 - 15 10月 2005

指纹

探究 'Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs' 的科研主题。它们共同构成独一无二的指纹。

引用此