Abstract
A complete forcing set of a graph G with a perfect matching is a subset of E(G) on which the restriction of each perfect matching M is a forcing set o......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
