### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 305-308 |

Number of pages | 4 |

Journal | Journal of Graph Theory |

Volume | 22 |

Issue number | 4 |

DOIs | |

Publication status | Published - 1996 Aug |

### Fingerprint

### ASJC Scopus subject areas

- Geometry and Topology