Dominating sets for split and bipartite graphs
Information Processing Letters
The NP-completeness of Steiner Tree and Dominating Set for chordal bipartite graphs
Theoretical Computer Science
Nonconstructive advances in polynomial-time complexity
Information Processing Letters
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
Domination in convex and chordal bipartite graphs
Information Processing Letters
Subgraphs and well-quasi-ordering
Journal of Graph Theory
Line graphs and forbidden induced subgraphs
Journal of Combinatorial Theory Series B
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
NP-hard graph problems and boundary classes of graphs
Theoretical Computer Science
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
List coloring in the absence of two subgraphs
Discrete Applied Mathematics
| Hi-index | 5.23 |
We study the following question: given a finite collection of graphs G"1,...,G"k, is the dominating set problem polynomial-time solvable in the class of (G"1,...,G"k)-free graphs? In this paper, we prove the existence of an efficient algorithm that answers this question for k=2.