Title of article
Long cycles in 3-cyclable graphs Original Research Article
Author/Authors
D. Bauer، نويسنده , , L. McGuire، نويسنده , , H. Trommel، نويسنده , , H.J. Veldman، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
8
From page
1
To page
8
Abstract
It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α, then G contains a cycle of length at least min {n,3δ−3,n+δ−α}.
Keywords
3-cyclable , Hamilton cycle , Graph , Long cycle
Journal title
Discrete Mathematics
Serial Year
2000
Journal title
Discrete Mathematics
Record number
950433
Link To Document