Characterizing graphs of small carving-width

Characterizing graphs of small carving-width

We characterize all graphs that have carving-width at most  k for k=1,2,3. In particular, we show that a graph has carving-width at most 3 if and only if it has maximum degree at most 3 and treewidth at most 2. This enables us to identify the immersion obstruction set for graphs of carving-width at...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2013-09, Vol.161 (13-14), p.1888-1893
Hauptverfasser: Belmonte, Rémy, van ’t Hof, Pim, Kamiński, Marcin, Paulusma, Daniël, Thilikos, Dimitrios M.
Format: Artikel
Sprache:eng
Schlagworte:
Carving-width
Computer Science
Discrete Mathematics
Graphs
Immersion
Mathematical analysis
Obstruction set
Obstructions
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We characterize all graphs that have carving-width at most  k for k=1,2,3. In particular, we show that a graph has carving-width at most 3 if and only if it has maximum degree at most 3 and treewidth at most 2. This enables us to identify the immersion obstruction set for graphs of carving-width at most 3.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2013.02.036