par Belmonte, Rémy;Van't Hof, Pim;Kaminski, Marcin 
;Paulusma, Daniël;Thilikos Touloupas, Dimitrios
Référence Discrete applied mathematics, 161, 13-14, page (1888-1893)
Publication Publié, 2013-09
;Paulusma, Daniël;Thilikos Touloupas, Dimitrios Référence Discrete applied mathematics, 161, 13-14, page (1888-1893)
Publication Publié, 2013-09
Article révisé par les pairs
| Résumé : | 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. © 2013 Elsevier B.V. All rights reserved. |
