Advertisement

Theory of Computing Systems

, Volume 39, Issue 4, pp 561–590 | Cite as

Clique-Width for 4-Vertex Forbidden Subgraphs

  • Andreas BrandstadtEmail author
  • Joost EngelfrietEmail author
  • Hoang-Oanh LeEmail author
  • Vadim V. LozinEmail author
Article

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.

Keywords

Chordal Graph Prime Graph Graph Class Free Graph Split Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Institut fur Informatik, Universitat Rostock, D-18051 RostockGermany
  2. 2.LIACS, Leiden University, P.O. Box 9512, 2300 RA LeidenThe Netherlands
  3. 3.Fachbereich Informatik, Technische Fachhochschule Berlin, D-13353 BerlinGermany
  4. 4.RUTCOR, Rutgers University, 640 Bartholomew Rd., Piscataway, NJ 08854-8003USA

Personalised recommendations