标题:Partitioning a graph into cycles with a specified number of chords
作者:Chiba, Shuya; Jiang, Suyun; Yan, Jin
作者机构:[Chiba, Shuya] Kumamoto Univ, Fac Adv Sci & Technol, Appl Math, 2-39-1 Kurokami, Kumamoto 8608555, Japan.; [Jiang, Suyun; Yan, Jin] Shandong Univ, S 更多
通讯作者:Chiba, S
通讯作者地址:[Chiba, S]Kumamoto Univ, Fac Adv Sci & Technol, Appl Math, 2-39-1 Kurokami, Kumamoto 8608555, Japan.
来源:JOURNAL OF GRAPH THEORY
DOI:10.1002/jgt.22534
关键词:Chorded cycles; cycles; degree sum conditions; partitions
摘要:For a graph G, let sigma 2(G) be the minimum degree sum of two nonadjacent vertices in G. A chord of a cycle in a graph G is an edge of G joining two nonconsecutive vertices of the cycle. In this paper, we prove the following result, which is an extension of a result of Brandt et al for large graphs: For positive integers k and c, there exists an integer f(k,c) such that if G is a graph of order n >= f(k,c) and sigma 2(G)>= n, then G can be partitioned into k vertex-disjoint cycles, each of which has at least c chords.
收录类别:SCIE
资源类型:期刊论文
TOP