A decidability result for the dominating set problem

Abstract

We study the following question: given a finite collection of graphs $G_1,\dots ,G_k$, is the dominating set problem polynomial-time solvable in the class of $(G_1,\dots ,G_k)$-free graphs? In this paper, we prove the existence of an efficient algorithm that answers this question for $k=2$.