A new recursive theorem onn-extendibility |
| |
| Authors: | Nishimura Tsuyoshi |
| |
| Institution: | (1) Department of Mathematics, Shibaura Institute of Technology, Fukasaku, 330 Omiya, Japan |
| |
| Abstract: | A graphG having a 1-factor is calledn-extendible if every matching of sizen extends to a 1-factor. LetG be a 2-connected graph of order 2p. Letr 0 andn>0 be integers such thatp–rn+1. It is shown that ifG/S isn-extendible for every connected subgraphS of order 2r for whichG/S is connected, thenG isn-extendible. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
