Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time

Andreas Brandstädt, Raffaele Mosca. Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time. Discrete Applied Mathematics, 284:269-280, 2020. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.