Boundary classes of graphs for the dominating set problem Original Research Article

The notion of a boundary class has been recently introduced as a tool for classification of hereditary classes of graphs according to the time complexity of NP-hard graph problems. In the present paper we concentrate on the dominating set problem and obtain three boundary classes for it.