On independent triples and vertex-disjoint chorded cycles in graphs
On independent triples and vertex-disjoint chorded cycles in graphs
复制标题
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
R. Gould;Kazuhide Hirohata;A. Rorabaugh
中科院分区：
文献类型：
--
作者：
R. Gould;Kazuhide Hirohata;A. Rorabaugh
设G是一个图，σ3（G）是G的三个独立顶点的最小度和.证明了若G是阶至少为8k + 5且σ3（G）≥ 9k − 2（k ≥ 1）的图，则G包含k个点不相交的弦圈.我们还证明了σ3（G）的度和条件是尖锐的。
Let G be a graph, and let σ3(G) be the minimum degree sum of three independent vertices of G. We prove that if G is a graph of order at least 8k + 5 and σ3(G) ≥ 9k − 2 with k ≥ 1, then G contains k vertex-disjoint chorded cycles. We also show that the degree sum condition on σ3(G) is sharp.