A complexity dichotomy for the dominating set problem
arXiv:1506.00202
Abstract
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.