A decidability result for the dominating set problem

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