= Dirac circumference theorem {c} A $k$-connected graph has a cycle of length at least $\min\{|G|,2k\}$.
Back to article page
