On Oriented Colourings of Graphs on Surfaces
Abstract
ABSTRACT For an oriented graph , the least number of colours required to oriented colour is called the oriented chromatic number of and denoted . For a non‐negative integer let be the least integer such that for every oriented graph with Euler genus at most . We will prove that is nearly linear in the sense that . This resolves a question of the author, Bradshaw, and Xu, by improving their bounds of the form and .
Fields of Study & Subjects
Advanced Graph Theory Research
Graph Labeling and Dimension Problems
Publication details
- Journal / source
- Journal of Graph Theory
- Volume
- 112
- Issue
- 4
- Pages
- 357–369
- Publication date
- 8 April 2026
- Language
- EN