DeepAI
Log In Sign Up

Edge-trewidth: Algorithmic and combinatorial properties

12/14/2021
by   Loïc Magne, et al.
0

We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of edge-treewidth. We first observe that edge-treewidth does not enjoy any closeness properties under the known partial ordering relations on graphs. We introduce a variant of the topological minor relation, namely, the weak topological minor relation and we prove that edge-treewidth is closed under weak topological minors. Based on this new relation we are able to provide universal obstructions for edge-treewidth. The proofs are based on the fact that edge-treewidth of a graph is parametetrically equivalent with the maximum over the treewidth and the maximum degree of the blocks of the graph. We also prove that deciding whether the edge-treewidth of a graph is at most k is an NP-complete problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/21/2019

The size Ramsey number of graphs with bounded treewidth

A graph G is Ramsey for a graph H if every 2-colouring of the edges of G...
02/28/2022

Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts

Decompositional parameters such as treewidth are commonly used to obtain...
06/10/2020

Treewidth versus clique number in graph classes with a forbidden structure

Treewidth is an important graph invariant, relevant for both structural ...
04/28/2020

As Time Goes By: Reflections on Treewidth for Temporal Graphs

Treewidth is arguably the most important structural graph parameter lead...
07/06/2018

Limits of Treewidth-based tractability in Optimization

Sparse structures are frequently sought when pursuing tractability in op...
04/30/2019

Improved bounds for the excluded-minor approximation of treedepth

Treedepth, a more restrictive graph width parameter than treewidth and p...
12/13/2018

3-Manifold triangulations with small treewidth

Motivated by fixed-parameter tractable (FPT) problems in computational t...