Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Brandstädt, A., Dragan, F., Le, HO. et al. New Graph Classes of Bounded Clique-Width. Theory Comput Syst 38, 623–645 (2005). https://doi.org/10.1007/s00224-004-1154-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1154-6