On Oriented Colourings of Graphs on Surfaces

Alexander Clow

For an oriented graph $G$, the least number of colours required to oriented colour $G$ is called the oriented chromatic number of $G$ and denoted ${\chi }_o(G)$.For a non-negative intege…