1 citations · 1 across the 1 of their papers we have counts for
1 paper
Javad B. Ebrahimi, Aref Nemayande, Aref Namayandeh +1
A complete forcing set of a graph is a subset S of its edges with the following property. For any perfect matching M, M is the unique perfect matching containing the intersec…