Abstract
A graph G is said to he n-extendable if it has a matching of size n, and every matching of size n extends to a perfect matching of G. Let G = (X, Y) h......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
