Oriented Colourings of Graphs with Maximum Degree Three and Four

12/13/2018

∙

by   Christopher Duffy, et al.

∙

0

∙

share

We show that any orientation of a graph with maximum degree three has an oriented 9-colouring, and that any orientation of a graph with maximum degree four has an oriented 69-colouring. These results improve the best known upper bounds of 11 and 80, respectively.