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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Brandstadt, A., Engelfriet, J., Le, HO. et al. Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput Syst 39, 561–590 (2006). https://doi.org/10.1007/s00224-005-1199-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-005-1199-1