Advanced Search

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

Cited in: Zbl 1216.05064 Zbl 1199.05202 Zbl 1023.05083

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]