Decompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords
复制标题
DOI：
10.1016/j.jctb.2017.07.002
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
P. Balister;Hao Li;R. Schelp
中科院分区：
文献类型：
--
作者：
P. Balister;Hao Li;R. Schelp
我们证明了如果G是一个至少有3个r+ 4 s顶点且最小度至少为2 r+ 3 s的图，则G包含r+ s个顶点不交圈，其中每个圈包含两个弦，或者是4阶且包含一个弦.
We show that if G is a graph on at least 3 r+ 4 s vertices with minimum degree at least 2 r+ 3 s, then G contains r+ s vertex disjoint cycles, where each of s of these cycles either contain two chords, or are of order 4 and contain one chord.