A note on n‐extendable graphs
Qinglin Yu · Journal of Graph Theory · 1992
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.