Format:
graph. Darst.
ISSN:
1432-4350
Content:
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.
In:
Theory of computing systems, New York, NY : Springer, 1997, 39(2006), 4, Seite 561-590, 1432-4350
In:
volume:39
In:
year:2006
In:
number:4
In:
pages:561-590
Language:
English
Author information:
Brandstädt, Andreas 1949-
Bookmarklink