Uniquely Restricted Matchings in Interval Graphs

Mathew C. Francis, Dalu Jacob, Satyabrata Jana

A matching $M$ in a graph $G$ is said to be uniquely restricted if there is no other matching in $G$ that matches the same set of vertices as $M$. We describe a polynomial-time alg…