On forbidden subdivision characterizations of graph classes

European Journal of Combinatorics

Volumn 29, Issue 5, 2008, Pages 1321-1332

  Dvořák, Zdeněk ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 42649100304     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.05.008     Document Type: Article

References (18)

1. 4's. Electronic J. Combin. 11 #R26 (2004)
2. Alon N., and Spencer J.H. The Probabilistic Method. 2nd edn (2000), Wiley-Interscience, New York
3. Borodin O.V. On acyclic colorings of planar graphs. Discrete Math. 25 (1979) 211-236
4. Chen G., and Schelp R.H. Graphs with linearly bounded Ramsey numbers. J. Combin. Theory, Ser. B 57 (1993) 138-149
5. Dinski T., and Zhu X. A bound for the game chromatic number of graphs. Discrete Math. 196 (1999) 109-115
6. Erdo{double acute}s P. Problems and results on finite and infinite graphs. Recent Advances in Graph Theory (Proc. Second Czechoslovak Symposium, Prague, 1974) (1975), Academia, Prague 183-192
7. Nešetřil J., and Ossona de Mendez P. In: Pach J., et al. (Ed). Colorings and Homomorphisms of Minor Closed Classes (2003), J. Goodman and R. Pollack Festschrift, Springer, Berlin 651-664
8. J. Nešetřil, P. Ossona de Mendez, Fraternal augmentations, arrangeability and linearly bounded Ramsey numbers, J. Graph Theory (submitted for publication)
9. Nešetřil J., and Ossona de Mendez P. Grad and classes with bounded expansion I-decompositions. European J. Combin. 29 3 (2008) 760-776
10. Nešetřil J., and Ossona de Mendez P. Grad and classes with bounded expansion II-algorithmic aspects. European J. Combin. 29 3 (2008) 777-791
11. Nešetřil J., and Ossona de Mendez P. Grad and classes with bounded expansion III-restricted dualities. European J. Combin. 29 4 (2008) 1012-1024
12. H.A. Kierstead, private communication
13. Kierstead H.A., and Trotter W.T. Planar graph coloring with an uncooperative partner. J. Graph Theory 18 (1994) 569-584
14. Kierstead H.A., and Yang D. Orderings on graphs and game coloring number. Order 20 (2003) 255-264
15. Rödl V. On the chromatic number of subgraphs of a given graph. Proc. Amer. Math. Soc. 64 2 (1977) 370-371
16. Rödl V., and Thomas R. Arrangeability and clique subdivisions. In: Graham R.L., and Nešetřil J. (Eds). The Mathematics of Paul Erdo{double acute}s (1991), Springer, Berlin 236-239
17. E. Szemerédi (joint work with J. Komlós), Colloquium at Emory University, Atlanta, GA, April 22, 1994
18. Wood D.R. Acyclic, star and oriented colourings of graph subdivisions. Discrete Math. Theor. Comput. Sci. 7 (2005) 37-50