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]
@article{BrandstadtM20b, title = {Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time}, author = {Andreas Brandstädt and Raffaele Mosca}, year = {2020}, doi = {10.1016/j.dam.2020.01.028}, url = {https://doi.org/10.1016/j.dam.2020.01.028}, researchr = {https://researchr.org/publication/BrandstadtM20b}, cites = {0}, citedby = {0}, journal = {Discrete Applied Mathematics}, volume = {283}, pages = {417-434}, }