Geodesic
A NOTE ON THE CIRCUMFERENCE OF GRAPHS
Acta mathematica Universitatis Comenianae, Tome 64 (1995) no. 2 
L. Stacho. A NOTE ON THE CIRCUMFERENCE OF GRAPHS. Acta mathematica Universitatis Comenianae, Tome 64 (1995) no. 2. http://geodesic.mathdoc.fr/item/AMUC_1995_64_2_a6/
@article{AMUC_1995_64_2_a6,
     author = {L. Stacho},
     title = {A {NOTE} {ON} {THE} {CIRCUMFERENCE} {OF} {GRAPHS}},
     journal = {Acta mathematica Universitatis Comenianae},
     year = {1995},
     volume = {64},
     number = {2},
     url = {http://geodesic.mathdoc.fr/item/AMUC_1995_64_2_a6/}
}
TY  - JOUR
AU  - L. Stacho
TI  - A NOTE ON THE CIRCUMFERENCE OF GRAPHS
JO  - Acta mathematica Universitatis Comenianae
PY  - 1995
VL  - 64
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/AMUC_1995_64_2_a6/
ID  - AMUC_1995_64_2_a6
ER  - 
%0 Journal Article
%A L. Stacho
%T A NOTE ON THE CIRCUMFERENCE OF GRAPHS
%J Acta mathematica Universitatis Comenianae
%D 1995
%V 64
%N 2
%U http://geodesic.mathdoc.fr/item/AMUC_1995_64_2_a6/
%F AMUC_1995_64_2_a6

Voir la notice de l'article provenant de la source Comenius University

\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.