Folding

Journal of Combinatorial Theory. Series B

Volumn 96, Issue 5, 2006, Pages 730-739

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

^a CHARLES UNIVERSITY   (Czech Republic)

^b CNRS   (France)

Author keywords

Bound; Coloring; Homomorphism; Minor

Indexed keywords

EID: 33744519056     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2006.02.002     Document Type: Article

References (15)

1. Alon N., and Marshall T.H. Homomorphisms of edge-colored graphs and Coxeter groups. J. Algebraic Combin. 8 (1998) 5-13
2. Alon N., McDiarmid C.J.H., and Reed B.A. Acyclic coloring of graphs. Random Structures Algorithms 2 (1991) 343-365
3. Dreyer P., Malon Ch., and Nešetřil J. Universal H-colorable graphs without a given configuration. Discrete Math. 250 (2002) 245-252
4. Fertin G., Raspaud A., and Reed B. On star coloring of graphs. Proccedings of GW'01. Lecture Notes in Comput. Sci. (2001), Springer, Berlin
5. Häggkvist R., and Hell P. Universality of A-mote graphs. European J. Combin. 14 (1993) 23-27
6. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford Univ. Press, Oxford
7. Jensen T., and Toft B. Graph Coloring Problems (1965), Wiley, New York
8. T.H. Marshall, R. Nasraser, J. Nešetřil, Bounds for homomorphisms classes of graphs, European J. Combin., in press
9. R. Naserasr, Y. Nigussie, On the new reformulation of Hadwiger's conjecture, submitted for publication
10. Nešetřil J. Aspects of structural combinatorics. Taiwanese J. Math. 3 4 (1999) 381-424
11. Nešetřil J., and Ossona de Mendez P. Colorings and homomorphisms of minor closed classes. In: Pach J., et al. (Ed). J. Goodman and R. Pollack Festschrift (2003), Springer, Berlin 651-664
12. Nešetřil J., and Ossona de Mendez P. Cuts and bounds. Structural Combinatorics-Combinatorial and Computational Aspects of Optimization. Topology and Algebra Discrete Math. 302 1-3 (2005) 211-224
13. Nešetřil J., and Raspaud A. Colored homomorphisms of colored mixed graphs. J. Combin. Theory Ser. B 80 (2000) 147-155
14. Sopena E., and Raspaud A. Good and semi-strong colorings of oriented planar graphs. Inf. Process. Lett. 51 (1994) 171-174
15. Thomassen C. Grötzsch's 3-color theorem and its counterparts fo r torus and the projective plane. J. Combin. Theory Ser. B 62 (1994) 268-279