Component Factors and Induced Subgraphs

Tsuyoshi Nishimura

doi:10.1002/(SICI)1097-0118(199604)22:4<305::AID-JGT4>3.0.CO;2-T

Component Factors and Induced Subgraphs

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.1002/(SICI)1097-0118(199604)22:4<305::AID-JGT4>3.0.CO;2-T
Publication status	Published - 1996 Aug

ASJC Scopus subject areas

Geometry and Topology

Access to Document

10.1002/(SICI)1097-0118(199604)22:4<305::AID-JGT4>3.0.CO;2-T

Cite this

@article{0505d84608594b08b67943351a6c1496,

title = "Component Factors and Induced Subgraphs",

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.",

author = "Tsuyoshi Nishimura",

year = "1996",

month = aug,

doi = "10.1002/(SICI)1097-0118(199604)22:4<305::AID-JGT4>3.0.CO;2-T",

language = "English",

volume = "22",

pages = "305--308",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "4",

}

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

U2 - 10.1002/(SICI)1097-0118(199604)22:4<305::AID-JGT4>3.0.CO;2-T

DO - 10.1002/(SICI)1097-0118(199604)22:4<305::AID-JGT4>3.0.CO;2-T

M3 - Article

AN - SCOPUS:0030500096

SN - 0364-9024

VL - 22

SP - 305

EP - 308

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 4

ER -

Component Factors and Induced Subgraphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this