Dominating Induced Matchings for P 7-Free Graphs in Linear Time
LetG be a finite undirected graph with edge set E. An edge set E??E is an induced matching inG if the pairwise distance of the edges of E? inG is at least two; E? is dominating inG if every edge e?E?E? intersects some edge in E?. The Dominating Induced Matching Problem (DIM, for short) asks for the existence of an induced matching E? which is also dominating inG; this problem is also known as the Efficient Edge Domination Problem.
dominating induced matching p 7-free graphs efficient edge domination linear time algorithm robust algorithm