Let k be a positive integer, and let G be a graph of order n with n ≧ 4 k - 5, kn even and minimum degree at least k. We prove that if the degree sum of each pair of nonadjacent vertices is at least n, then G has a k-factor.
|Number of pages||9|
|Journal||Graphs and Combinatorics|
|Publication status||Published - 1991 Dec 1|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics