Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time

Andreas Brandstädt, Raffaele Mosca. Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time. Discrete Applied Mathematics, 283:417-434, 2020. [doi]

No reviews for this publication, yet.