A new recursive theorem on n-extendibility

Tsuyoshi Nishimura

doi:10.1007/BF01202239

A new recursive theorem on n-extendibility

Tsuyoshi Nishimura

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

1 Citation (Scopus)

Abstract

A graph G having a 1-factor is called n-extendible if every matching of size n extends to a 1-factor. Let G be a 2-connected graph of order 2p. Let r ≥ 0 and n > 0 be integers such that p - r ≥ n + 1. It is shown that if G\S is n-extendible for every connected subgraph S of order 2r for which G\S is connected, then G is n-extendible.

Original language	English
Pages (from-to)	79-83
Number of pages	5
Journal	Graphs and Combinatorics
Volume	13
Issue number	1
DOIs	https://doi.org/10.1007/BF01202239
Publication status	Published - 1997 Jan 1

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1007/BF01202239

Cite this

@article{bbf4affe877d4a91af91704560f9bdb5,

title = "A new recursive theorem on n-extendibility",

abstract = "A graph G having a 1-factor is called n-extendible if every matching of size n extends to a 1-factor. Let G be a 2-connected graph of order 2p. Let r ≥ 0 and n > 0 be integers such that p - r ≥ n + 1. It is shown that if G\S is n-extendible for every connected subgraph S of order 2r for which G\S is connected, then G is n-extendible.",

author = "Tsuyoshi Nishimura",

year = "1997",

month = jan,

day = "1",

doi = "10.1007/BF01202239",

language = "English",

volume = "13",

pages = "79--83",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - A new recursive theorem on n-extendibility

AU - Nishimura, Tsuyoshi

PY - 1997/1/1

Y1 - 1997/1/1

N2 - A graph G having a 1-factor is called n-extendible if every matching of size n extends to a 1-factor. Let G be a 2-connected graph of order 2p. Let r ≥ 0 and n > 0 be integers such that p - r ≥ n + 1. It is shown that if G\S is n-extendible for every connected subgraph S of order 2r for which G\S is connected, then G is n-extendible.

AB - A graph G having a 1-factor is called n-extendible if every matching of size n extends to a 1-factor. Let G be a 2-connected graph of order 2p. Let r ≥ 0 and n > 0 be integers such that p - r ≥ n + 1. It is shown that if G\S is n-extendible for every connected subgraph S of order 2r for which G\S is connected, then G is n-extendible.

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

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

U2 - 10.1007/BF01202239

DO - 10.1007/BF01202239

M3 - Article

AN - SCOPUS:27144463163

SN - 0911-0119

VL - 13

SP - 79

EP - 83

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

A new recursive theorem on n-extendibility

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this