On the clique-width of some perfect graph classes

International Journal of Foundations of Computer Science

Volumn 11, Issue 3, 2000, Pages 423-443

  Golumbic, Martin Charles ^a   Rotics, Udi ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Clique width; distance hereditary graphs; permutation graphs; square grids; unit interval graphs

Indexed keywords

EID: 0037874823     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054100000260     Document Type: Article

References (15)

1. A. Brandstadt and F. F. Dragan, "A linear-time algorithm for connected r-domination and steiner tree on distance-hereditary graphs," Networks 31 (1998) 177-182.
2. B. Courcelle, J. Engelfriet, and G. Rozenberg, "Handle-rewriting hypergraph grammars," J. Comput. System Sci. 46 (1993) 218-270.
3. B. Courcelle, J. A. Makowsky, and U. Rotics, "Linear time solvable optimization problems on graphs of bounded clique-width," Theory of Computing Systems 33 (2000) 125-150
4. B. Courcelle, J. A. Makowsky, and U. Rotics, "On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic," to appear in Disc. Appl. Math.
5. B. Courcelle and S. Olariu, "Upper bounds to the chque-width of graphs," Disc. Appl. Math. 101 (2000) 77-114.
6. A. D'Atri and M. Moscarini. "Distance-hereditary graphs Steiner trees and connected domination," SIAM J. Comput. 17 (1988) 521-538.
7. F. F. Dragan, F. Nicolai, and A. Brandstadt, "LexBFS-orderings and powers of graphs," in Graph Theoretic Concepts in Computer Science, 22th International Workshop, WG'96, Lecture Notes in Computer Science 1197 (1997) 166-180.
8. F. F. Dragan. "Dominating cliques in distance-hereditary graphs," in Algorithm theory-SWAT94, Lecture Notes in Computer Science 824 (1994) 370-381.
9. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
10. M. C. Golumbic and U. Rotics, "On the chque-width of perfect graph classes (extended abstract)" in P. Widmayer, G. Neyer and S. Eidenbenz (Eds.) Graph Theoretic Concepts in Computer Science, 25th International Workshop, WG'99, Lecture Notes in Computer Science 1665 (1999) 135-147.
11. M. C. Golumbic and U. Rotics. "The chque-width of unit interval graphs is unbounded," in 30th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Boca Raton, 1999.
12. P. L. Hammer and F. Maffray. "Completely separable graphs," Disc. Appl. Math. 27 (1990) 85-99.
13. E. Howorka. "A characterization of distance-hereditary graphs," Q. J. Math. Oxford Ser. (2) 28 (1977) 417-420.
14. J. A. Makowsky and U. Rotics, "On the classes of graphs with few P^s" International Journal of Foundations of Computer Science 10 (1999) 329-348.
15. U. N. Peled and J. Wu. "Restricted unimodular chordal graphs," Journal of Graph Theory 30 (1999) 121-136.