Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0882.05081
Brandt, Stephan
A sufficient condition for all short cycles.
(English)
[J] Discrete Appl. Math. 79, No.1-3, 63-66 (1997). ISSN 0166-218X

Summary: Generalizing a result of {\it R. Häggkvist}, {\it R. J. Faudree} and {\it R. H. Schelp} [Ars Comb. 11, 37-49 (1981; Zbl 0485.05038)], we prove that every non-bipartite graph of order $n$ with more than $(n-1)^2/4+ 1$ edges contains cycles of every length between 3 and the length of a longest cycle.
MSC 2000:
*05C38 Paths and cycles

Keywords: pancyclic graphs; Hamiltonian graph; bipartite graph; circumference; short cycles; longest cycle

Citations: Zbl 0485.05038

Highlights
Master Server