The Oriented Chromatic Number of the Hexagonal Grid is 6
Antoni Lozano

TL;DR
This paper determines that the oriented chromatic number of the hexagonal grid family is exactly 6, resolving a previous gap between known bounds.
Contribution
The paper proves that the lower bound for the oriented chromatic number of hexagonal grids is 6, establishing the exact value.
Findings
The oriented chromatic number of hexagonal grids is exactly 6.
Previous bounds were improved to a precise value.
The result closes the gap in the known bounds.
Abstract
The oriented chromatic number of a directed graph is the minimum order of an oriented graph to which has a homomorphism. The oriented chromatic number of a graph family is the maximum oriented chromatic number over any orientation of any graph in . For the family of hexagonal grids , Bielak (2006) proved that . Here we close the gap by showing that .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Advanced Topology and Set Theory
