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]

Authors

Andreas Brandstädt

This author has not been identified. Look up 'Andreas Brandstädt' in Google

Raffaele Mosca

This author has not been identified. Look up 'Raffaele Mosca' in Google