论文标题
在$ 2 $连接的图表和Dirac定理上
On a property of $2$-connected graphs and Dirac's Theorem
论文作者
论文摘要
我们完善了1952年《狄拉克》（Dirac）经典论文中描述的$ 2 $连接图的属性，并使用精制属性稍缩短了狄拉克（Dirac）的证明，即每个$ 2 $连接的$ n $ vertex tem temimim temmimim tem $ k $至少具有至少长度的长度周期，至少有$ \ \ \ \ \ \ \ \ \ {n，2k \ {n，2k \ \} $。
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\}$.
