Copyright © 2004 Elsevier B.V. All rights reserved.
Note
Received 12 December 2002;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In this note, we give a new short proof of the following theorem: Let G be a 2-connected graph of order n. If for any two vertices u and v with d(u,v)=2, max d(u),d(v)
c/2, then the circumference of G is at least c, where 3
c
n and d(u,v) is the distance between u and v in G.
Keywords: Circumference; Distance







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)

max(





