Uniqueness and minimal obstructions for tree-depth
From MaRDI portal
Publication:898117
DOI10.1016/j.disc.2015.09.027zbMath1327.05313arXiv1502.05277OpenAlexW2142143427MaRDI QIDQ898117
John Sinkovic, Michael D. Barrus
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.05277
Related Items
A polynomial excluded-minor approximation of treedepth, Uniqueness and minimal obstructions for tree-depth, On 1-uniqueness and dense critical graphs for tree-depth
Cites Work
- Forbidden graphs for tree-depth
- Ordered coloring of grids and related graphs
- Ranking numbers of graphs
- Uniqueness and minimal obstructions for tree-depth
- Optimal node ranking of trees
- Ordered colourings
- Grad and classes with bounded expansion. I: Decompositions
- Tree-depth, subgraph coloring and homomorphism bounds
- Structural sparsity
- Obstructions for Tree-depth
- Rankings of Graphs
- On-line ranking number for cycles and paths