Independent domination in finitely defined classes of graphs

Authors:
R. Boliac;V. Lozin
Affiliations:
RUTCOR, Rutgers University, 640 Bartholomew Rd. Piscataway, NJ;RUTCOR, Rutgers University, 640 Bartholomew Rd. Piscataway, NJ
Venue:
Theoretical Computer Science
Year:
2003

Citing 12
Cited 7

On domination problems for permutation and other graphs

Theoretical Computer Science
Domination in convex and chordal bipartite graphs

Information Processing Letters
Domination on cocomparability graphs

SIAM Journal on Discrete Mathematics
Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
A decomposition for a class of &parl0;P5,P5&parr0;- free graphs

Discrete Mathematics
On semi-P4-sparse graphs

Proceedings of an international symposium on Graphs and combinatorics
Weighted parameters in (P5,&Pmacr;5)-free graphs

Discrete Applied Mathematics
A nice class for the vertex packing problem

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

SIAM Journal on Computing
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
Bipartite graphs without a skew star

Discrete Mathematics

Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
Independent domination in hereditary classes

Theoretical Computer Science
NP-hard graph problems and boundary classes of graphs

Theoretical Computer Science
Boundary classes of planar graphs

Combinatorics, Probability and Computing
Note: On the inapproximability of independent domination in 2P3-free perfect graphs

Theoretical Computer Science
Independent sets in extensions of 2K2-free graphs

Discrete Applied Mathematics
Tree-width and optimization in bounded degree graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the independent dominating set problem restricted to graph classes defined by finitely many forbidden induced subgraphs. The main result is two sufficient conditions for the problem to be NP-hard in a finitely defined class of graphs. We conjecture that those conditions are also necessary and describe several classes of graphs verifying the conjecture.