Title of article
A sufficient condition for all short cycles Original Research Article
Author/Authors
Stephan Brandt، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
4
From page
63
To page
66
Abstract
Generalizing a result of Häggkvist et al. (1981), we prove that every non-bipartite graph of order n with more than (n − 1)24 + 1 edges contains cycles of every length between 3 and the length of a longest cycle.
Keywords
(Weakly) pancyclic graphs , Short cycles , size
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884640
Link To Document