The Grad of a Graph and Classes with Bounded Expansion
References (6)
- et al.
Exluding any graph as a minor allows a low tree-width 2-coloring
Journal of Combinatorial Theory, Series B
(2004) - et al.
Universal H-colourable graphs without a given configuration
Discrete Math.
(2002) - et al.
Universality of A–mote graphs
European Journal of Combinatorics
(1993)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2005 Elsevier B.V. All rights reserved.