Homomorphism bounded classes of graphs

European Journal of Combinatorics

Volumn 27, Issue 4, 2006, Pages 592-600

  Marshall, Timothy ^a   Nasraser, Reza ^b   Nešetřil, Jaroslav ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (18)

1. N. Alon T.H. Marshall Homomorphisms of edge-coloured graphs and Coxeter groups J. Algebraic Combin. 8 1998 5-13
2. K. Appel W. Haken Every planar map is four colorable Bull. Amer. Math. Soc. 82 1976 711-712
3. P. Dreyer Ch. Malon J. Nešetřil Universal H -colourable graphs without a given configuration Discrete Math. 250 2002 245-252
4. H. Grötzsch Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg, Math.-Natur. Reihe 8 1959 109-120
5. 5R. Häggkvist P. Hell Universality of A-mote graphs European J. Combin. 14 1993 23-27
6. P. Hell N. Nesetril Graphs and Homomorphisms 2004 Oxford University Press Oxford
7. R. Naserasr, Homomorphisms and edge colourings of planar graphs, J. Combin. Theory B (in press)
8. C.St.J.A. Nash-Williams Edge-disjoint spanning trees of finite graphs J. London Math. Soc. 36 1961 445-450
9. J. Nešetřil Aspects of structural combinatorics: Graph homomorphisms and their use Taiwan. J. Math. 3 4 1999 381-423
10. J. Nešetřil, Universal graphs for planar graphs, in: R. Čada, J. Maxová (Eds.), Graph Theory Day 2, KAM-DIMATIA Series 99-452, p. 12
11. J. Nešetřil, P.O. De Mendez, Folding. In: KAM-DIMATIA Series, vol. 585, 2004, J. Combin. Theory B (in press)
12. J. Nešetřil, P.O. de Mendez, Tree depth, subgraph coloring and homomorphism bounds, European J. Combin. 656 (2004) (in press)
13. J. Nešetřil A. Raspaud Colored homomorphisms of colored mixed graphs J. Combin. Theory B 80 2000 147-155
14. N. Robertson P. Seymour R. Thomas The four color theorem J. Combin. Theory. B 70 1997 2-44
15. A. Raspaud E. Sopena Good and semi-strong colorings of oriented planar graphs Inform. Process. Lett. 51 1994 171-174
16. C. Thomassen Grötzsch's 3-color theorem and its counterparts for torus and projective plane J. Combin. Theory B 62 1994 268-279
17. W.T. Tutte On a problem of decomposing a graph into n connected factors J. London. Math. Soc. 36 1961 221-230
18. X. Zhu Circular chromatic number of planar graphs with large odd girth Electronic. J. Combin. 25 2001