A Note on Colourings of Connected Oriented Cubic Graphs

08/08/2019

∙

by   Christopher Duffy, et al.

∙

0

∙

share

In this short note we show that every connected oriented cubic graph admits an 8-colouring. This lowers the best known upper bound for the chromatic number of connected oriented cubic graphs.