The Grad of a Graph and Classes with Bounded Expansion

Electronic Notes in Discrete Mathematics

Volumn 22, Issue , 2005, Pages 101-106

  Nešetřil, Jaroslav ^a   Ossona de Mendez, Patrice ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b CNRS   (France)

Author keywords

Bounded expansion; Coloring; Constrained orientation; Homomorphism; Restricted duality; Transitive fraternal augmentation; Tree depth

Indexed keywords

EID: 33748110461     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2005.06.018     Document Type: Article

References (6)

1. DeVos M., Ding G., Oporowski B., Sanders D., Reed B., Seymour P., and Vertigan D. Exluding any graph as a minor allows a low tree-width 2-coloring. Journal of Combinatorial Theory, Series B 91 (2004) 25-41
2. Dreyer P., Malon C., and Nešetřil J. Universal H-colourable graphs without a given configuration. Discrete Math. (2002) 245-252
3. Häggkvist R., and Hell P. Universality of A-mote graphs. European Journal of Combinatorics (1993) 23-27
4. Nešetřil J., and de Mendez P.O. Tree depth, subgraph coloring and homomorphism bounds. European Journal of Combinatorics (2004) (accepted)
5. Robertson N., and Seymour P. Graph Minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory, Series B 89 (2003) 43-76
6. Thomas, R., Problem session of the Third Slovene Conference on Graph Theory, Bled, Slovenia (1995)