Acyclic and Oriented Chromatic Numbers of Graphs

Journal of Graph Theory

Volumn 24, Issue 4, 1997, Pages 331-340

  Kostochka, A V ^a   Sopena, E ^b   Zhu, X ^c  

^a NOVOSIBIRSK STATE UNIVERSITY   (Russian Federation)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031518118     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199704)24:4<331::AID-JGT5>3.0.CO;2-P     Document Type: Article

References (16)

1. M. Albertson and D. Berman, An acyclic analogue to Heawood's theorem, Glasgow Math. J. 19 (1978), 163-166.
2. N. Alon and T. H. Marshall, Homomorphisms of edge-coloured graphs and Coxeter groups, manuscript (1996).
3. N. Alon, C. McDiarmid, and B. Read, Acyclic colorings of graphs, Random Structures and Algorithms 2 (1991), 277-289.
4. B. Courcelle, The monadic second order logic of graphs VI: On several representations of graphs by relational structures, Discrete Appl. Math. 54 (1994), 117-149.
5. F. Galvin, The list chromatic index of a bipartite multigraph. J. Combinatorial Theory (B) 63 (1995), 153-158.
6. R. Häggkvist and P. Hell, On A-mote universal graphs, Eur. J. Combin. 14 (1993), 23-27.
7. P. Hell and J. Nešetřil, On the complexity of H-coloring, J. Combinatorial Theory (B) 48 (1990), 92-110.
8. P. Hell, J. Nešetřil, and X. Zhu, Duality theorems and polynomial tree-coloring, Trans. Amer. Math. Soc. 348 (1996), 1281-1297.
9. P. Hell, J. Nešetřil, and X. Zhu, Duality of graph homomorphism, Combinatorics, Paul Erdös is eighty, Vol. 2, Bolyai Society Mathematical Studies (1996), 271-282.
10. T. R. Jensen and B. Toft, Graph coloring problems, Wiley Interscience, New York (1995).
11. A. V. Kostochka and L. S. Mel'nikov, Note to the paper of Grünbaum on acyclic colorings, Discrete Math. 14 (1976), 403-406.
12. C. St. J. A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964).
13. J. Nešetřil, A. Raspaud, and E. Sopena, Colorings and girth of oriented planar graphs, Discrete Math., to appear.
14. J. Nešetřil and X. Zhu, On bounded treewidth duality of graph homomorphisms, J. Graph Theory 23 (1996), 151-162.
15. A. Raspaud and E. Sopena, Good and semi-strong colorings of oriented planar graphs, Inf. Processing Lett. 51 (1994), 171-174.
16. E. Sopena, The chromatic number of oriented graphs, J. Graph Theory, to appear.