Title of article
The number of cycle lengths in graphs of given minimum degree and girth Original Research Article
Author/Authors
P. Erd?s، نويسنده , , R.J. Faudree، نويسنده , , C.C Rousseau، نويسنده , , R.H. Schelp، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
6
From page
55
To page
60
Abstract
This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ckg/8.
Keywords
Minimum degree , Predecessor , cycle lengths , Girth
Journal title
Discrete Mathematics
Serial Year
1999
Journal title
Discrete Mathematics
Record number
950802
Link To Document