Minimum forcing numbers of perfect matchings of circular and prismatic graphs

Qiaoyun Shi, Heping Zhang

Let $G$ be a graph with a perfect matching. Denote by $f(G)$ the minimum size of a matching in $G$ that is uniquely extendable to a perfect matching in $G$. Diwan (2019) used linea…