A lower bound for the circumference of a graph

Let G=(V, E) be a block of order n, different from K"n. Let m=min {d(x)+d(y): [x, y]@?E}. We show that if m=