Clique-Width for 4-Vertex Forbidden Subgraphs

Authors:
Andreas Brandstadt;Joost Engelfriet;Hoang-Oanh Le;Vadim V. Lozin
Affiliations:
Institut fur Informatik, Universitat Rostock, D-18051 Rostock, Germany;LIACS, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands;Fachbereich Informatik, Technische Fachhochschule Berlin, D-13353 Berlin, Germany;RUTCOR, Rutgers University, 640 Bartholomew Rd., Piscataway, NJ 08854-8003, USA
Venue:
Theory of Computing Systems
Year:
2006

Citing 0
Cited 6

Clique-width minimization is NP-hard

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Recent developments on graphs of bounded clique-width

Discrete Applied Mathematics
A Complete Characterisation of the Linear Clique-Width of Path Powers

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A new characterization of P6-free graphs

Discrete Applied Mathematics
Colouring of graphs with Ramsey-type forbidden subgraphs

Theoretical Computer Science
List coloring in the absence of two subgraphs

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.