There exist oriented planar graphs with oriented chromatic number at least sixteen

Abstract We prove that there exist oriented planar graphs with oriented chromatic number at least 16. Using a result of Raspaud and Sopena [Inform. Process. Lett. 51 (1994) 171–174], this gives that the oriented chromatic number of the family of oriented planar graphs lies between 16 and 80.

[1]  André Raspaud,et al.  On universal graphs for planar oriented graphs of a given girth , 1998, Discret. Math..

[2]  K. B. Reid,et al.  Doubly Regular Tournaments are Equivalent to Skew Hadamard Matrices , 1972, J. Comb. Theory, Ser. A.

[3]  André Raspaud,et al.  On the maximum average degree and the oriented chromatic number of a graph , 1999, Discret. Math..

[4]  André Raspaud,et al.  Good and Semi-Strong Colorings of Oriented Planar Graphs , 1994, Inf. Process. Lett..

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[6]  Éric Sopena,et al.  Oriented graph coloring , 2001, Discret. Math..

[7]  Éric Sopena.  The chromatic number of oriented graphs , 1997, J. Graph Theory.

[8]  André Raspaud,et al.  Colorings and girth of oriented planar graphs , 1997, Discret. Math..