Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5776799 | Discrete Mathematics | 2017 | 7 Pages |
Abstract
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 Corrádi and Hajnal (1963).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zhihui Jiao, Hong Wang, Jin Yan,