Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Math. 25, 211–236 (1979)
2. Borodin, O.V., Ivanova, A.O.: An oriented 7-coloring of planar graphs with girth at least 7. Sib. Electron. Math. Rep. 2, 222–229 (2005)
3. Borodin, O.V., Ivanova, A.O., Kostochka, A.V.: Oriented 5-coloring of vertices in sparse graphs. (Russian) Diskretn. Anal. Issled. Oper. Ser. 1, 13(1), 16–32 (2006); translation in J. Appl. Ind. Math. 1(1), 9–17 (2007)
4. Borodin, O.V., Kostochka, A.V., Nešetřil, J., Raspaud, A., Sopena, E.: On the maximum average degree and the oriented chromatic number of a graph. Discrete Math. 206, 77–90 (1999)
5. Marshall, T.H.: Homomorphism bounds for oriented planar graphs of given minimum girth. Graphs Comb. 29, 1489–1499 (2013)