Clique-width for four-vertex forbidden subgraphs

Authors:
Andreas Brandstädt;Joost Engelfriet;Hoàng-Oanh Le;Vadim V. Lozin
Affiliations:
Institut für Informatik, Universität Rostock, Rostock, Germany;LIACS, Leiden University, Leiden, The Netherlands;Fachbereich Informatik, Technische Fachhochschule Berlin, Berlin, Germany;RUTCOR, Rutgers University, Piscataway, NJ
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 16
Cited 0

Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
Graph classes: a survey

Graph classes: a survey
Modular decomposition and transitive orientation

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

Discrete Applied Mathematics
Three-colourbility and forbidden subgraphs. II: polynomial algorithms

Discrete Mathematics
Maximum weight stable set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time

Information Processing Letters
Bipartite graphs without a skew star

Discrete Mathematics
On the Clique-Width of Graphs in Hereditary Classes

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
New Graph Classes of Bounded Clique-Width

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Structure and stability number of chair-, co-P- and gem-free graphs revisited

Information Processing Letters
On variations of P4-sparse graphs

Discrete Applied Mathematics
On the structure and stability number of P5- and co-chair-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the structure of (P5,gem)-free graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Stability number of bull- and chair-free graphs revisited

Discrete Applied Mathematics
(P5,diamond)-free graphs revisited: structure and linear time optimization

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Clique-width of graphs is a major new concept with respect to efficiency of graph algorithms. The notion of clique-width extends the one of treewidth, since bounded treewidth implies bounded clique-width. We give a complete classification of all graph classes defined by forbidden induced subgraphs of at most four vertices with respect to bounded or unbounded clique-width.