Matching preservers

A subset M  E(G) of the edge set E(G) of a graph G is called a matching provided that no two edges in M have a vertex in common. A perfect matching M is a matching with the property that each vertex of G is incident with an edge in M. For k a positive integer, a graph G is k-extendable provided that G has a matching of size k and every matching in G of size at most k can be extended to a perfect matching in G.

15p thulanh6 14-09-2011 57 4   Download