Andreas Brandstädt, Raffaele Mosca. Dominating induced matchings in S1, 2, 4-free graphs. Discrete Applied Mathematics, 278:83-92, 2020. [doi]
@article{BrandstadtM20,
title = {Dominating induced matchings in S1, 2, 4-free graphs},
author = {Andreas Brandstädt and Raffaele Mosca},
year = {2020},
doi = {10.1016/j.dam.2018.09.028},
url = {https://doi.org/10.1016/j.dam.2018.09.028},
researchr = {https://researchr.org/publication/BrandstadtM20},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {278},
pages = {83-92},
}