Characterizations of various matching extensions in graphs.
Qinglin Yu · 1993
Let n be a positive integer with n $; (V(O)-2)/2. A graph G is n-extendable if it contains a set of n independent edges and every set of n independent edges can be extended to a perfect matching of G. In this paper, we give a characterization of n-extendable graphs. The characterizations of other matching extension are also discussed.