1 citations · 1 across the 1 of their papers we have counts for
1 paper
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.