EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

On Oriented Colourings of Graphs on Surfaces

Alexander Clow

Journal of Graph Theory · 2026-08 · 112 (4) · 357-369

DOI: 10.1002/jgt.70042 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 08.04.2026. Verfasst von Alexander Clow. Die Arbeit nennt 16 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 .

Zitieren

APA

Clow, A. (2026). On Oriented Colourings of Graphs on Surfaces. Journal of Graph Theory, 112(4), 357-369. https://doi.org/10.1002/jgt.70042

Vancouver

Clow A. On Oriented Colourings of Graphs on Surfaces. Journal of Graph Theory. 2026;112(4):357-369. doi:10.1002/jgt.70042

BibTeX
@article{Clow2026,
  author = {Clow, Alexander},
  title = {On Oriented Colourings of Graphs on Surfaces},
  journal = {Journal of Graph Theory},
  year = {2026},
  volume = {112},
  number = {4},
  pages = {357--369},
  doi = {10.1002/jgt.70042}
}
Kostenlos starten →