Dominating induced matchings in graphs containing no long claw

Alain Hertz, Vadim Lozin, Bernard Ries +2

An induced matching $M$ in a graph $G$ is dominating if every edge not in $M$ shares exactly one vertex with an edge in $M$. The dominating induced matching problem (also known as…