Abstract
Purchase PDF (264 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (7)
Purchase PDF (284 K)
doi:10.1016/S0304-3975(02)00586-8 
Copyright © 2002 Elsevier Science B.V. All rights reserved.
Independent domination in finitely defined classes of graphs
Received 3 February 2002;
revised 4 July 2002;
accepted 19 July 2002;
Communicated by A. Razborov
Available online 28 January 2003.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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.
Author Keywords: Graph; Independent dominating set; Computational complexity
