DeepAI AI Chat
Log In Sign Up

Obstructions for bounded shrub-depth and rank-depth

11/01/2019
by   O-joung Kwon, et al.
0

Shrub-depth and rank-depth are dense analogues of the tree-depth of a graph. It is well known that a graph has large tree-depth if and only if it has a long path as a subgraph. We prove an analogous statement for shrub-depth and rank-depth, which was conjectured by Hliněný, Kwon, Obdržálek, and Ordyniak [Tree-depth and vertex-minors, European J. Combin. 2016]. Namely, we prove that a graph has large rank-depth if and only if it has a vertex-minor isomorphic to a long path. This implies that for every integer t, the class of graphs with no vertex-minor isomorphic to the path on t vertices has bounded shrub-depth.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/18/2020

Counting Bounded Tree Depth Homomorphisms

We prove that graphs G, G' satisfy the same sentences of first-order log...
09/12/2018

Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded

A class G of graphs is χ-bounded if there is a function f such that for...
08/02/2020

Tree pivot-minors and linear rank-width

Tree-width and its linear variant path-width play a central role for the...
08/22/2022

Product structure of graph classes with strongly sublinear separators

We investigate the product structure of hereditary graph classes admitti...
03/04/2019

An application of the Gyárfás path argument

We adapt the Gyárfás path argument to prove that t-2 cops can capture a ...
09/28/2017

Energy Constrained Depth First Search

Depth first search is a natural algorithmic technique for constructing a...
07/02/2020

Parallel Planar Subgraph Isomorphism and Vertex Connectivity

We present the first parallel fixed-parameter algorithm for subgraph iso...