Highly Influenced

# Characterizations of various matching extensions in graphs

@article{Yu1993CharacterizationsOV, title={Characterizations of various matching extensions in graphs}, author={Qinglin Yu}, journal={Australasian J. Combinatorics}, year={1993}, volume={7}, pages={55-64} }

- Published 1993 in Australasian J. Combinatorics

Let n be a positive integer with n $; (V(O)-2)/2. A graph G is nextendable 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.