论文部分内容阅读
Let G be a graph with edge set E(G)that admits a perfect matching M.A forcing set of M is a subset of M contained in no other perfect matchings of G.A complete forcing set of G,recently introduced by Xu et al.