Forbidden graphs for tree-depth
Authors:
- Zdeněk DvořákZdeněk Dvořák
- Archontia C. GiannopoulouAGArchontia C. Giannopoulou
- Dimitrios M. ThilikosDTDimitrios M. Thilikos
- 1 July 2012
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 33 (5) , 969-979
Abstract
No abstract availableKeywords
Funding Information
- ERC (259385)
- Institute for Theoretical Computer Science (1M0021620808)
- Kapodistrias (02839/28.07.2008)
This publication has 14 references indexed in Scilit:
- Obstructions for Tree-depthElectronic Notes in Discrete Mathematics, 2009
- Grad and classes with bounded expansion II. Algorithmic aspectsEuropean Journal of Combinatorics, 2008
- Grad and classes with bounded expansion I. DecompositionsEuropean Journal of Combinatorics, 2008
- Tree-depth, subgraph coloring and homomorphism boundsEuropean Journal of Combinatorics, 2006
- Linear time low tree-width partitions and algorithmic consequences2006
- Rankings of GraphsSIAM Journal on Discrete Mathematics, 1998
- Ordered colouringsDiscrete Mathematics, 1995
- Optimal edge ranking of trees in polynomial timeAlgorithmica, 1995
- On vertex ranking for permutation and other graphsLecture Notes in Computer Science, 1994
- The Role of Elimination Trees in Sparse FactorizationSIAM Journal on Matrix Analysis and Applications, 1990