Clique-Width for 4-Vertex Forbidden Subgraphs
- 109 Downloads
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.
KeywordsChordal Graph Prime Graph Graph Class Free Graph Split Graph
Unable to display preview. Download preview PDF.