Obstructions for tree-depth
From MaRDI portal
Publication:2851471
Recommendations
Cites work
- scientific article; zbMATH DE number 3650583 (Why is no real title available?)
- scientific article; zbMATH DE number 1414315 (Why is no real title available?)
- Algorithms and obstructions for linear-width and related search parameters
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Graph minors. XX: Wagner's conjecture
- Linear time low tree-width partitions and algorithmic consequences
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Optimal edge ranking of trees in polynomial time
- Ordered colourings
- Rankings of Graphs
- The Role of Elimination Trees in Sparse Factorization
- Tree-depth, subgraph coloring and homomorphism bounds
Cited in
(5)
This page was built for publication: Obstructions for tree-depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851471)