Clique-Width for 4-Vertex Forbidden Subgraphs

Clique-Width for 4-Vertex Forbidden Subgraphs

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 o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theory of computing systems 2006-07, Vol.39 (4), p.561-590
Hauptverfasser: Brandstadt, Andreas, Engelfriet, Joost, Le, Hoang-Oanh, Lozin, Vadim V.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Decomposition
Graph algorithms
Graphs
Neighborhoods
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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. [PUBLICATION ABSTRACT]
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-005-1199-1