Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903082 | Discrete Mathematics | 2018 | 6 Pages |
Abstract
Let k be a positive integer. In this paper, we prove that for a graph G with at least 4k vertices, if max{d(x),d(y)}â¥2k for any pair of nonadjacent vertices {x,y}âV(G), then G contains k disjoint cycles. This generalizes the results given by Corrá di and Hajnal (1963), Enomoto (1998), and Wang (1999).
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jin Yan, Shaohua Zhang, Junqing Cai,