  We characterise the form of all simple, finite graphs for which the girth of
the graph is equal to the circumference of the graph. We apply this to prove a
bound on the number of edges in such a graph.
