Sufficient conditions for n-matchable graphs.
Dingjun Lou, Qinglin Yu · 2004
Let n be a non-negative integer. A graph G is said to be n-matchable if the subgraph G − S has a perfect matching for any subset S of V (G) with |S | = n. In this paper, we obtain sufficient conditions for different classes of graphs to be n-matchable. Since 2k-matchable graphs must be k-extendable, we have generalized the results about k-extendable graphs. All results in this paper are sharp.