|
|||||
|
|
A note on n-extendable graphs |
|
| Authors: | Qinglin Yu |
| Abstract: | A graph G having a perfect matching is called n-extendable if every matching of size n of G can be extended to a perfect matching. In this note, we show that if G is an n-extendable nonbipartite graph, then G + e is (n - 1)-extendable for any edge e ? E(G). © 1992 John Wiley & Sons, Inc. |
| Keywords: | |