Tree-depth, subgraph coloring and homomorphism bounds
- 1 August 2006
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 27 (6) , 1022-1041
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Universal partial order represented by means of oriented trees and other simple graphsEuropean Journal of Combinatorics, 2005
- Excluding any graph as a minor allows a low tree-width 2-coloringJournal of Combinatorial Theory, Series B, 2004
- Universal H-colorable graphs without a given configurationDiscrete Mathematics, 2002
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination TreeJournal of Algorithms, 1995
- Local-Global Phenomena in GraphsCombinatorics, Probability and Computing, 1993
- Universality of A-mote GraphsEuropean Journal of Combinatorics, 1993
- Star arboricityCombinatorica, 1992
- Acyclic coloring of graphsRandom Structures & Algorithms, 1991
- A separator theorem for nonplanar graphsJournal of the American Mathematical Society, 1990
- On acyclic colorings of planar graphsDiscrete Mathematics, 1979