Anti-forcing numbers of perfect matchings of graphs

Hongchuan Lei, Yeong-Nan Yeh, Heping Zhang

We define the anti-forcing number of a perfect matching $M$ of a graph $G$ as the minimal number of edges of $G$ whose deletion results in a subgraph with a unique perfect matching…