Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2009-06-06

Journal: DISCRETE MATHEMATICS

Included Journals: Scopus、EI、SCIE

Volume: 309

Issue: 11

Page Number: 3580-3587

ISSN: 0012-365X

Key Words: Claw-free graph; Circumference; 3-connectedness; Minimum degree

Abstract: In this paper, we prove that every 3-connected claw-free graph G on n vertices contains a cycle of length at least min{n, 6 delta-15}, thereby generalizing several known results. (C) 2008 Elsevier B.V. All rights reserved.