Forbidden graphs for tree-depth
From MaRDI portal
Publication:412288
DOI10.1016/J.EJC.2011.09.014zbMATH Open1239.05062OpenAlexW2016741021MaRDI QIDQ412288FDOQ412288
Dimitrios M. Thilikos, Zdeněk Dvořák, Archontia C. Giannopoulou
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.014
Cites Work
- Graph minors. XX: Wagner's conjecture
- 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
- Tree-depth, subgraph coloring and homomorphism bounds
- Rankings of Graphs
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Algorithms and obstructions for linear-width and related search parameters
- Ordered colourings
- The Role of Elimination Trees in Sparse Factorization
- Title not available (Why is that?)
- Optimal edge ranking of trees in polynomial time
- Linear time low tree-width partitions and algorithmic consequences
- Title not available (Why is that?)
- Outerplanar obstructions for the feedback vertex set
- Obstructions for tree-depth
Cited In (24)
- Effective computation of immersion obstructions for unions of graph classes
- On the tree-depth and tree-width in heterogeneous random graphs
- Forbidding Kuratowski Graphs as Immersions
- A polynomial excluded-minor approximation of treedepth
- Forbidding multiple copies of forestable graphs
- On the lossy kernelization for connected treedepth deletion set
- On 1-uniqueness and dense critical graphs for tree-depth
- Faster parameterized algorithms for modification problems to minor-closed classes
- Minor-obstructions for apex sub-unicyclic graphs
- Characterizing graphs of small carving-width
- Minor obstructions for apex-pseudoforests
- On low tree-depth decompositions
- Uniqueness and minimal obstructions for tree-depth
- Characterizing graphs of maximum matching width at most 2
- Characterizing width two for variants of treewidth
- Title not available (Why is that?)
- Sparse obstructions for minor-covering parameters
- Minor-obstructions for apex sub-unicyclic graphs
- Improved Bounds for the Excluded-Minor Approximation of Treedepth
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders
- On the tree-depth of random graphs
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- Forbidden induced subgraphs and the Łoś-Tarski theorem
- The complexity of bicriteria 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)
