Component Factors and Induced Subgraphs

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)305-308
Number of pages4
JournalJournal of Graph Theory
Volume22
Issue number4
DOIs
Publication statusPublished - 1996 Aug

    Fingerprint

ASJC Scopus subject areas

  • Geometry and Topology

Cite this