Let G and K be connected graphs such that |G| = n|K| (n ≥ 2) and let p be a fixed integer satisfying 1 < p < n. We prove that if G \ A has a K-factor for every connected subgraph A with |A| = p|K|, then G also has a K-factor.
|Number of pages||4|
|Journal||Journal of Graph Theory|
|Publication status||Published - 1996 Aug|
ASJC Scopus subject areas
- Geometry and Topology