×

zbMATH — the first resource for mathematics

A note on the circumference of graphs. (English) Zbl 0846.05053
Summary: The well-known Bondy theorem [J. A. Bondy, Discrete Math. 1, No. 2, 121-132 (1971; Zbl 0224.05120)] guarantees (in terms of vertex degrees) a sufficiently “large” cycle in a block. We show that adding a condition on connectivity of these blocks yields an improvement of the lower bound in Bondy’s theorem.
MSC:
05C38 Paths and cycles
PDF BibTeX XML Cite
Full Text: EMIS EuDML