Publikationen suchen

Publikation
Autoren
Einrichtungen
Aktiv: Abstract
Externe Dokumente
Links

Clique-width for 4-vertex forbidden subgraphs ( Zeitschriftenartikel )

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.

Anzahl Zeichen: 374