12 citations · 25 across the 6 of their papers we have counts for
1 paper · 2 filters
D. S. Malyshev
We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.