Dirac circumference theorem

A $k$-connected graph has a cycle of length at least $\min \{|G|,2k\}$.

A component outside a longest cycle has at least $k$ attachment vertices in a $k$-connected graph, and no two attachments are consecutive, forcing cycle length at least $2k$.