PERFECT MATCHINGS AVOIDING SCATTERED EDGES IN A STAR-FREE GRAPH
For non-negative integers d and l, a graph G is said to be if for any subset F of such that and for every pair of edges there exists a perfect matching M of G with In this paper, we prove that for integers m and l with and every m-connected -free graph is and show that the star-freeness is the best possible.
perfect matching, matching extension, distance matching extension, star-free graph.
