Abstract
Let M(n) denote the set of all matchings of the complete graph K-n. Set t = [n/2]. For 0 <= k < 1 <= t-k <= t, let M(k, l) denote the inci......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
