Obstructions for Tree-depth

DOI10.1016/j.endm.2009.07.041zbMath1273.05212OpenAlexW1999614709MaRDI QIDQ2851471

Dimitrios M. Thilikos, Archontia C. Giannopoulou

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.041

zbMATH Keywords

obstructionsgraph enumerationgraph minorstree depthvertex rankings

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph minors (05C83)

Related Items (4)

Graph Minors and Parameterized Algorithm Design ⋮ Outerplanar obstructions for a feedback vertex set ⋮ Forbidden graphs for tree-depth ⋮ Uniqueness and minimal obstructions for tree-depth

Cites Work

• Graph minors. XX: Wagner's conjecture
• Minimal acyclic forbidden minors for the family of graphs with bounded path-width
• Algorithms and obstructions for linear-width and related search parameters
• Optimal edge ranking of trees in polynomial time
• Ordered colourings
• 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
• Linear time low tree-width partitions and algorithmic consequences
• The Role of Elimination Trees in Sparse Factorization
• Rankings of Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Obstructions for Tree-depth