Let G be a graph of order n ≥ 4k + 1, where k is a positive integer with kn even and δ(G) ≥ k. We prove that if the degree sum of each pair of nonadjacent vertices is at least n + 1, then G has a k-factor including any given edge. Similarly, a sufficient condition for graphs to have a k-factor excluding any given edge is also given.
展开▼
