×

Oriented colorings of triangle-free planar graphs. (English) Zbl 1173.68593


MSC:

68R05 Combinatorics in computer science
68R10 Graph theory (including graph drawing) in computer science
Full Text: DOI

References:

[1] Borodin, O. V., On acyclic colorings of planar graphs, Discrete Math., 25, 211-236 (1979) · Zbl 0406.05031
[2] 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-89 (1999) · Zbl 0932.05033
[3] Fried, E., On homogeneous tournaments, Combinatorial Theory and Its Applications, vol. 2 (1970), North-Holland: North-Holland Amsterdam, pp. 467-476 · Zbl 0215.33704
[4] Kostochka, A. V.; Mel’nikov, L. S., Note to the paper of Grünbaum on acyclic colorings, Discrete Math., 14, 403-406 (1976) · Zbl 0318.05103
[5] Nešetřil, J.; Raspaud, A., Antisymmetric flows and strong colorings of oriented planar graphs, Ann. Inst. Fourier, 49, 3, 1037-1056 (1999) · Zbl 0921.05034
[6] Raspaud, A.; Sopena, E., Good and semi-strong colorings of oriented planar graphs, Inform. Process. Lett., 51, 4, 171-174 (1994) · Zbl 0806.05031
[7] Sopena, E., Oriented graph coloring, Discrete Math., 229, 1-3, 359-369 (2001) · Zbl 0971.05039
[8] Sopena, E., There exist oriented planar graphs with oriented chromatic number at least sixteen, Inform. Process. Lett., 81, 6, 309-312 (2002)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.