Oriented Colourings of Graphs with Maximum Degree Three and Four
classification
💻 cs.DM
math.CO
keywords
degreemaximumorientedcolouringfourgraphorientationthree
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.