Hardness of Forcing Unique Perfect Matchings in Bipartite Graphs of Maximum Degree 3

Ryoma Aoshima, Takashi Horiyama, Atsuki Nagao +4

In a graph $G$, a set of edges $F$ is called a \emph{forcing set} if there exists a unique perfect matching $M$ such that $F\subseteq M$. Similarly, a set of edges $A$ is called a…