Extremal graphs with prescribed circumference and cocircumference Original Research Article

Let G be a loopless 2-connected graph with circumference c and with largest bond of size c∗. In an earlier paper, the author proved that |E(G)|⩽12cc∗. This paper determines all 2-connected graphs that attain equality in this bound showing that these graphs are certain special series–parallel networks.