Tree-depth and vertex-minors

DOI10.1016/j.ejc.2016.03.001zbMath1335.05168arXiv1403.7024OpenAlexW1827118975MaRDI QIDQ281932

Petr Hliněný, Jan Obdržálek, Sebastian Ordyniak, O-joung Kwon

Publication date: 11 May 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.7024

zbMATH Keywords

tree-widthdistance-hereditarylinear rank-widthpath-widthpivot-minorrank-widthvertex-minor

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items

Rank-width: algorithmic and structural results ⋮ Graphs of bounded depth‐2 rank‐brittleness ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ Obstructions for bounded shrub-depth and rank-depth ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-minors, monadic second-order logic, and a conjecture by Seese
• Principal pivot transforms: Properties and applications
• Upper bounds to the clique width of graphs
• Handle-rewriting hypergraph grammars
• Graphs of small rank-width are pivot-minors of graphs of small tree-width
• Tree-depth, subgraph coloring and homomorphism bounds
• Approximating clique-width and branch-width
• Rank-width and vertex-minors
• When Trees Grow Low: Shrubs and Fast MSO1
• Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences

This page was built for publication: Tree-depth and vertex-minors