Skip to main content
Log in

Clique-Width for 4-Vertex Forbidden Subgraphs

Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Andreas Brandstadt, Joost Engelfriet, Hoang-Oanh Le or Vadim V. Lozin.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1199-1

Keywords

Navigation