Theory of Computing Systems

, Volume 38, Issue 5, pp 623–645 | Cite as

New Graph Classes of Bounded Clique-Width

  • Andreas BrandstädtEmail author
  • Feodor F. DraganEmail author
  • Hoàng-Oanh LeEmail author
  • Raffaele MoscaEmail author


The clique-width of graphs is a major new concept with respect to the efficiency of graph algorithms; it is known that every problem expressible in a certain kind of Monadic Second Order Logic called LinEMSOL(τ1,L) by Courcelle et al. is linear-time solvable on any graph class with bounded clique-width for which a k-expression for the input graph can be constructed in linear time. 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 one-vertex extensions of the P4 (i.e., the path with four vertices a,b,c,d and three edges ab,bc,cd) with respect to bounded clique-width. Our results extend and improve recent structural and complexity results in a systematic way.


Computational Mathematic Linear Time Order Logic Input Graph Graph Algorithm 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2004

Authors and Affiliations

  1. 1.Fachbereich Informatik, Universität Rostock, D-18051 Rostock Germany
  2. 2.Department of Computer Science, Kent State University, Kent, OH 44242 USA
  3. 3.Dipartimento di Scienze, Università degli Studi “G. D’Annunzio’’, Viale Pindaro 42, Pescara 65127 Italy

Personalised recommendations