On a property of 2-connected graphs and Dirac's Theorem
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:RTAJF6X4record.jsonopen to challenge →
classification
math.CO
keywords
connecteddiracpropertygraphsleastclassicalcycledegree
read the original abstract
We refine a property of $2$-connected graphs described in the classical paper of Dirac from 1952 and use the refined property to somewhat shorten Dirac's proof of the fact that each $2$-connected $n$-vertex graph with minimum degree at least $k$ has a cycle of length at least $\min\{n,2k\}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.