Maximal cycles in graphs

Abstract Let G be a simple graph on n vertices and m edges having circumference (longest cycle length) t . Woodall determined some time ago the maximum possible value of m . The object of this paper is to give an alternative proof of Woodall's theorem. Our approach will, in addition, characterize the structure of the extremal graphs.