### 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 |

Publication status | Published - 1996 Aug |

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

*Journal of Graph Theory*,

*22*(4), 305-308.

**Component Factors and Induced Subgraphs.** / Nishimura, Tsuyoshi.

Research output: Contribution to journal › Article

*Journal of Graph Theory*, vol. 22, no. 4, pp. 305-308.

}

TY - JOUR

T1 - Component Factors and Induced Subgraphs

AU - Nishimura, Tsuyoshi

PY - 1996/8

Y1 - 1996/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030500096&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030500096&partnerID=8YFLogxK

M3 - Article

VL - 22

SP - 305

EP - 308

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 4

ER -