On objects dual to tree-cut decompositions

03/26/2021
by   Łukasz Bożyk, et al.
0

Tree-cut width is a graph parameter introduced by Wollan that is an analogue of treewidth for the immersion order on graphs in the following sense: the tree-cut width of a graph is functionally equivalent to the largest size of a wall that can be found in it as an immersion. In this work we propose a variant of the definition of tree-cut width that is functionally equivalent to the original one, but for which we can state and prove a tight duality theorem relating it to naturally defined dual objects: appropriately defined brambles and tangles. Using this result we also propose a game characterization of tree-cut width.

READ FULL TEXT

page 6

page 9

page 11

page 13

page 17

page 18

page 19

page 22

research
06/30/2022

Slim Tree-Cut Width

Tree-cut width is a parameter that has been introduced as an attempt to ...
research
08/02/2018

Lean tree-cut decompositions: obstructions and algorithms

The notion of tree-cut width has been introduced by Wollan [The structur...
research
06/01/2022

Algorithmic Applications of Tree-Cut Width

The recently introduced graph parameter tree-cut width plays a similar r...
research
02/09/2023

A new width parameter of graphs based on edge cuts: α-edge-crossing width

We introduce graph width parameters, called α-edge-crossing width and ed...
research
06/03/2019

Generalizations of k-Weisfeiler-Leman partitions and related graph invariants

The family of Weisfeiler-Leman equivalences on graphs is a widely studie...
research
09/11/2023

Generalized Graphon Process: Convergence of Graph Frequencies in Stretched Cut Distance

Graphons have traditionally served as limit objects for dense graph sequ...
research
03/14/2023

A Structural Approach to Tree Decompositions of Knots and Spatial Graphs

Knots are commonly represented and manipulated via diagrams, which are d...

Please sign up or login with your details

Forgot password? Click here to reset