Disjoint cycles in graphs with distance degree sum conditions

作者：Jiao, Zhihui; Wang, Hong; Yan, Jin^*

来源：Discrete Mathematics, 2017, 340(6): 1203-1209.

DOI：10.1016/j.disc.2017.01.013

• Graph
• Disjoint
• Degree condition
• Cycle

In this paper, we prove that for any positive integer k and for any simple graph G of order at least 3k, if d(x) + d(y) >= 4k for every pair of vertices x and y of distance 2 in G, then with one exception, G contains k disjoint cycles. This generalizes a former result of Corradi and Hajnal (1963).

• 出版日期2017-6
• 单位山东大学