A Note on Colourings of Connected Oriented Cubic Graphs
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.
READ FULL TEXT