Randomly matchable graphs
David P. Summer · Journal of Graph Theory · 1979
Abstract A graph is defined to be randomly matchable if every matching of G can be extended to a perfect matching. It is shown that the connected randomly matchable graphs are precisely K2n and Kn,n (n ≥ 1).