Partial Degree Conditions and Cycle Coverings

Abstract

Abstract Let G be a graph of order n . Let W be a subset of with , where k is a positive integer. We show that if for each , then G contains k vertex‐disjoint cycles covering W such that each of the k cycles contains at least three vertices of W .