Abstract.
\looseness=1The well-known Bondy's Theorem Ref. 1 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.
Compressed Postscript 
