Forbidden graphs for tree-depth
From MaRDI portal
Publication:412288
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
- Obstructions for tree-depth
- Optimal edge ranking of trees in polynomial time
- Ordered colourings
- Outerplanar obstructions for the feedback vertex set
- Rankings of Graphs
- The Role of Elimination Trees in Sparse Factorization
- Tree-depth, subgraph coloring and homomorphism bounds
Cited in
(26)- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders
- Computing tree-depth faster than \(2^n\)
- Minor obstructions for apex-pseudoforests
- Characterizing width two for variants of treewidth
- On the lossy kernelization for connected treedepth deletion set
- A polynomial excluded-minor approximation of treedepth
- Minor-obstructions for apex sub-unicyclic graphs
- Obstructions for bounded shrub-depth and rank-depth
- Forbidden induced subgraphs and the Łoś-Tarski theorem
- Minor-obstructions for apex sub-unicyclic graphs
- Characterizing graphs of maximum matching width at most 2
- scientific article; zbMATH DE number 7525471 (Why is no real title available?)
- Faster parameterized algorithms for modification problems to minor-closed classes
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- On the tree-depth of random graphs
- Obstructions for tree-depth
- On low tree-depth decompositions
- Uniqueness and minimal obstructions for tree-depth
- Sparse obstructions for minor-covering parameters
- Forbidding multiple copies of forestable graphs
- The complexity of bicriteria tree-depth
- On the tree-depth and tree-width in heterogeneous random graphs
- Improved bounds for the excluded-minor approximation of treedepth
- Characterizing graphs of small carving-width
- Forbidding Kuratowski graphs as immersions
- On 1-uniqueness and dense critical graphs for tree-depth
This page was built for publication: Forbidden graphs for tree-depth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412288)
