Tree-depth and vertex-minors

Hliněný, P and Kwon, O-joung and Obdržálek, J and Ordyniak, S (2016) Tree-depth and vertex-minors. EUROPEAN JOURNAL OF COMBINATORICS, 56. pp. 46-56. ISSN 0195-6698 10.1016/j.ejc.2016.03.001

[img] Text
Hlyneny_46_3177664_ny.pdf

Download (363kB)
[img] Text
Hlyneny_46_3177664_z.pdf
Restricted to Registered users only

Download (414kB)

Abstract

Abstract In a recent paper Kwon and Oum (2014), Kwon and Oum claim that every graph of bounded rank-width is a pivot-minor of a graph of bounded tree-width (while the converse has been known true already before). We study the analogous questions for “depth” parameters of graphs, namely for the tree-depth and related new shrub-depth. We show how a suitable adaptation of known results implies that shrub-depth is monotone under taking vertex-minors, and we prove that every graph class of bounded shrub-depth can be obtained via vertex-minors of graphs of bounded tree-depth. While we exhibit an example that pivot-minors are generally not sufficient (unlike Kwon and Oum (2014)) in the latter statement, we then prove that the bipartite graphs in every class of bounded shrub-depth can be obtained as pivot-minors of graphs of bounded tree-depth.

Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 03 Feb 2017 08:47
Last Modified: 03 Feb 2017 08:47
URI: http://eprints.sztaki.hu/id/eprint/9061

Update Item Update Item