On the clique—width of perfect graph classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1665, Issue , 1999, Pages 135-147

  Golumbic, Martin Charles ^a   Rotics, Udi ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

CLIQUE-WIDTH; DISTANCE-HEREDITARY GRAPHS; GRAPH OPERATIONS; LINEAR TIME; PERFECT GRAPH; PERMUTATION GRAPH; UNIT INTERVAL GRAPHS; UNIT INTERVALS;

GRAPH THEORY;

EID: 84947789062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46784-x_14     Document Type: Conference Paper

References (13)

1. A. Brandstadt and F.F. Dragan. A linear-time algorithm for connected r-domination and steiner tree on distance-hereditary graphs. Networks, 31:177-182, 1998. 136
2. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. J. Comput. System Sci., 46:218-270, 1993. 135, 138
3. B. Courcelle, J.A. Makowsky, and U. Rotics. Linear time solvable optimization problems on certain structured graph families, extended abstract. Graph Theoretic Concepts in Computer Science, 24th International Workshop, WG’98, volume 1517 of Lecture Notes in Computer Science, pages 1-16. Springer Ver-lang, 1998. 136
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. 136
5. B. Courcelle and S. Olariu. Upper bounds to the clique-width of graphs. to appear in Disc. Appl. Math. (http://dept-info.labri.u-bordeaux.fr/~courcell/ActSci.html), 1998. 135, 137, 138
6. A. D’Atri and M. Moscarini. Distance-hereditary graphs Steiner trees and connected domination. SIAM J. Comput., 17:521-538, 1988. 136
7. F.F. Dragan, F. Nicolai, and A. Brandstadt. LexBFS-orderings and powers of graphs. Graph Theoretic Concepts in Computer Science, 22th International Workshop, WG’96, volume 1197 of Lecture Notes in Computer Science, pages 166-180, 1997. 136
8. F.F. Dragan. Dominating cliques in distance-hereditary graphs. Algorithm theory—SWAT’94, volume 824 of Lecture Notes in Computer Science, pages 370-381, 1994. 136
9. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, NewYork, 1980. 137, 143
10. P. L. Hammer and F. Maffray. Completely separable graphs. Disc. Appl. Math., 27:85-99, 1990. 136, 139
11. E. Howorka. A characterization of distance-hereditary graphs. Q. J. Math. Oxford Ser. (2), 28:417-420, 1977. 136
12. J.A. Makowsky and U. Rotics. On the classes of graphs with few P4’s. To appear in the International Journal of Foundations of Computer Science (IJFCS), 1999. 137
13. U. N. Peled and J. Wu. Restricted unimodular chordal graphs. To appear in Journal of Graph Theory, 1999. 136