A graph G with at least 2n+2 vertices is said to be n-extendable if every set of n disjoint edges in G extends to (i.e., is a subset of) a perfect matching. More generally, a graph is said to have property E(m,n) if, for every matching M of size m and every matching N of size n in G such
Michael Plummer hasn't uploaded this paper.
Create a free Academia account to let Michael know you want this paper to be uploaded.
