Tree-width dichotomy

12/02/2020
by   Vadim Lozin, et al.
0

We prove that the tree-width of graphs in a hereditary class defined by a finite set F of forbidden induced subgraphs is bounded if and only if F includes a complete graph, a complete bipartite graph, a tripod (a forest in which every connected component has at most 3 leaves) and the line graph of a tripod.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/12/2020

On the tree-width of even-hole-free graphs

The class of all even-hole-free graphs has unbounded tree-width, as it c...
research
02/09/2023

t-sails and sparse hereditary classes of unbounded tree-width

It has long been known that the following basic objects are obstructions...
research
06/01/2018

The Complexity of Bisimulation and Simulation on Finite Systems

In this paper the computational complexity of the (bi)simulation problem...
research
05/03/2020

Graph Homomorphism Convolution

In this paper, we study the graph classification problem from the graph ...
research
09/02/2019

Computation Protein Design instances with small tree-width: selection based on coarse approximated 3D average position volume

This paper proposes small tree-width graph decomposition computational p...
research
03/06/2018

Induced and Weak Induced Arboricities

We define the induced arboricity of a graph G, denoted by ia(G), as the...
research
10/16/2018

On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms

Detecting dense subgraphs from large graphs is a core component in many ...

Please sign up or login with your details

Forgot password? Click here to reset