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

Publication status | Published - 1997 |

### ASJC Scopus subject areas

- Mathematics(all)
- Discrete Mathematics and Combinatorics

### Cite this

*Graphs and Combinatorics*,

*13*(1), 79-83.

**A new recursive theorem on n-extendibility.** / Nishimura, Tsuyoshi.

Research output: Contribution to journal › Article

*Graphs and Combinatorics*, vol. 13, no. 1, pp. 79-83.

}

TY - JOUR

T1 - A new recursive theorem on n-extendibility

AU - Nishimura, Tsuyoshi

PY - 1997

Y1 - 1997

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

M3 - Article

VL - 13

SP - 79

EP - 83

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -