Characterizing graphs of small carving-width

Authors:
RéMy Belmonte;Pim Van 'T Hof;Marcin KamińSki;DaniëL Paulusma;Dimitrios M. Thilikos
Affiliations:
-;-;-;-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 13
Cited 1

Characterization and recognition of partial 3-trees

SIAM Journal on Algebraic and Discrete Methods
Designing multi-commodity flow trees

Information Processing Letters
Minimal acyclic forbidden minors for the family of graphs with bounded path-width

Discrete Mathematics - Special issue on graph theory and applications
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
Graphs with branchwidth at most three

Journal of Algorithms
Algorithms and obstructions for linear-width and related search parameters

Discrete Applied Mathematics
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Graph minors XXIII. Nash-Williams' immersion conjecture

Journal of Combinatorial Theory Series B
Graph coloring and the immersion order

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Finding topological subgraphs is fixed-parameter tractable

Proceedings of the forty-third annual ACM symposium on Theory of computing
List-coloring graphs without subdivisions and without immersions

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Outerplanar obstructions for a feedback vertex set

European Journal of Combinatorics
Forbidden graphs for tree-depth

European Journal of Combinatorics

Effective computation of immersion obstructions for unions of graph classes

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.04

Visualization

Abstract

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.