Matching extension in the powers ofn-connected graphs
Kara Walcher Shavo · Journal of Graph Theory · 1996
Let G be a graph on p vertices. Then for a positive integer n1 G is said to be n-extendible if (i) n < p/2, (ii) G has a set of n independent edges, and (iii) every such set is contained in a perfect matching of G. In this paper we will show that if p is even and G is n-connected, then Gk is -extendible for every integer k ≥ 2 such that . © 1996 John Wiley & Sons, Inc.