@inbook {IOPORT.06101523,
    author       = {Belmonte, R\'emy and van 't Hof, Pim and Kami\'nski, Marcin and Paulusma, Dani\"el and Thilikos, Dimitrios M.},
    title        = {Characterizing graphs of small carving-width.},
    year         = {2012},
    booktitle    = {Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5--9, 2012. Proceedings},
    isbn         = {978-3-642-31769-9},
    pages        = {360-370},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-642-31770-5_32},
    abstract     = {Summary: 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.},
    identifier   = {06101523},
}