A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs

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.