论文部分内容阅读
A graph G is induced matching extendable if every induced matching of G is included in a perfect matching of G.A graph G is generalized induced matching extendable if every induced matching of G is included in a maximum matching of G.A graph G is claw-fre