Extremal anti-forcing numbers of perfect matchings of graphs

Kai Deng, Heping Zhang

The anti-forcing number of a perfect matching $M$ of a graph $G$ is the minimal number of edges not in $M$ whose removal to make $M$ as a unique perfect matching of the resulting g…