Independent domination in finitely defined classes of graphs

Theoretical Computer Science

Volumn 301, Issue 1-3, 2003, Pages 271-284

  Boliac, R ^a   Lozin, V ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Computational complexity; Graph; Independent dominating set

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SET THEORY; THEOREM PROVING;

INDEPENDENT DOMINATING SET;

GRAPH THEORY;

EID: 0038371407     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00586-8     Document Type: Article

References (27)

1. V.E. Alekseev, On the number of maximal independent sets in graphs from hereditary classes, in: A.A. Markov (Ed.), Combinatorial-algebraic Methods in Discrete Optimization, University of Nizhny Novgorod, Nizhny, Novgorod, 1991, pp. 5-8 (in Russian).
2. Balas E., Yu Ch.S. On graphs with polynomially solvable maximum-weight clique problem. Networks. 19:1989;247-253.
3. Bertolazzi P., De Simone C., Galuccio A. A nice class for the vertex packing problem. Discrete Appl. Math. 76:1997;3-19.
4. Beyer T.A., Proskurowski A., Hedetniemi S.T., Mitchell S. Independent domination in trees. Congr. Numer. 19:1977;321-328.
5. Brandstädt A., Kratsch D. On domination problems on permutation and other graphs. Theoret. Comput. Sci. 54:1987;181-198.
6. A. Brandstädt, V.V. Lozin, On the linear structure and clique-width of bipartite permutation graphs, Ars Combin., to appear.
7. Chang M.-S. Efficient algorithms for the domination problems on interval and circle-arc graphs. SIAM J. Comput. 27:1998;1671-1694.
8. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraphs grammars. J. Comput. System Sci. 46:1993;218-270.
9. Courcelle B., Makowsky J.A., Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Systems. 33:2000;125-150.
10. Courcelle B., Olariu S. Upper bounds to the clique-width of a graphs. Discrete Appl. Math. 101:2000;77-114.
11. Damaschke P., Müller H., Kratsch D. Domination in convex and chordal bipartite graphs. Inform. Process. Lett. 36:1990;231-236.
12. De Simone C. On the vertex packing problem. Graphs Combin. 9:1993;19-30.
13. Duchet P. Classical perfect graphs. Ann. Discrete Math. 21:1984;67-96.
14. Farber M. Independent domination in chordal graphs. Oper. Res. Lett. 1:1982;134-138.
15. 5 ) -free graphs Discrete Math. 121:1993;75-83.
16. 4 -sparse graphs Discrete Math. 165-166:1997;277-300.
17. 5)-free graphs Discrete Appl. Math. 80(2-3):1997;255-261.
18. Golumbic M.C., Rotics U. On the clique-width of some perfect graph classes. Internat. J. Found. Comput. Sci. 11:2000;423-443.
19. Hoang C.T., Reed B.A. Some classes of perfectly orderable graphs. J. Graph Theory. 13:1989;445-463.
20. Kratsch D., Stewart L. Domination of co-comparability graphs. SIAM J. Discrete Math. 6(3):1993;400-417.
21. Lozin V.V. Bipartite graphs without a skew star. Discrete Math. 257:2002;83-100.
22. 4 's Internat. J. Found. Comput. Sci. 10(3):1999;329-348.
23. McConnell R.M., Spinrad J.P. Modular decomposition and transitive orientation. Discrete Math. 201:1999;189-241.
24. Minty G.J. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory, Ser. B. 28:1980;284-304.
25. E. Prisner, Graphs with few cliques, Graph Theory, Combinatorics, and Algorithms, vol. 1, 2, Kalamazoo, MI, 1992, Wiley-Interscience, Wiley, New York, 1995, pp. 945-956.
26. Sbihi N. Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoile. Discrete Math. 29:1980;53-76.
27. Tsukiyama S., Ide M., Ariyoshi H., Shirakawa I. A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6:1977;505-517.