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]
@article{BrandstadtM20c,
title = {Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time},
author = {Andreas Brandstädt and Raffaele Mosca},
year = {2020},
doi = {10.1016/j.dam.2020.03.043},
url = {https://doi.org/10.1016/j.dam.2020.03.043},
researchr = {https://researchr.org/publication/BrandstadtM20c},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {284},
pages = {269-280},
}