On the hardness of deciding the equality of the induced and the uniquely restricted matching number

Maximilian Fürst

If $G(M)$ denotes the subgraph of a graph $G$ induced by the set of vertices that are covered by some matching $M$ in $G$, then $M$ is an induced or a uniquely restricted matching…