The following publications are possibly variants of this publication:
- Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial timeAndreas Brandstädt, Raffaele Mosca. DAM, 284:269-280, 2020. [doi]
- Dominating induced matchings in S1, 2, 4-free graphsAndreas Brandstädt, Raffaele Mosca. DAM, 278:83-92, 2020. [doi]
- Dominating Induced Matchings for P 7-free Graphs in Linear TimeAndreas Brandstädt, Raffaele Mosca. isaac 2011: 100-109 [doi]
- Dominating Induced Matchings for P 7-Free Graphs in Linear TimeAndreas Brandstädt, Raffaele Mosca. algorithmica, 68(4):998-1018, 2014. [doi]