On the number of independent chorded cycles in a graph
On the number of independent chorded cycles in a graph
复制标题
DOI：
10.1016/j.disc.2007.09.035
复制
发表时间：
2008-11
期刊：
影响因子：
--
通讯作者：
D. Finkel
中科院分区：
文献类型：
--
作者：
D. Finkel
Hajnal和Corrádi证明了任何顶点数至少为3 k且最小度至少为2k的简单图都包含k个独立圈。我们证明了弦圈的类似结果。设G是一个简单图，其中|V（G）|最小度δ（G）<$4k和<$3k。则G包含k个独立的弦圈。这个结果是尖锐的。
Hajnal and Corrádi proved that any simple graph on at least 3k vertices with minimal degree at least 2k contains k independent cycles. We prove the analogous result for chorded cycles. Let G be a simple graph with |V(G)|⩾4k and minimal degree δ(G)⩾3k. Then G contains k independent chorded cycles. This result is sharp.