arXiv Analytics

Sign in

arXiv:2007.13111 [math.CO]AbstractReferencesReviewsResources

The Oriented Chromatic Number of the Hexagonal Grid is 6

Antoni Lozano

Published 2020-07-26Version 1

The oriented chromatic number of a directed graph $G$ is the minimum order of an oriented graph to which $G$ has a homomorphism. The oriented chromatic number $\chi_o({\cal F})$ of a graph family ${\cal F}$ is the maximum oriented chromatic number over any orientation of any graph in ${\cal F}$. For the family of hexagonal grids ${\cal H}_2$, Bielak (2006) proved that $5 \le \chi_o({\cal H}_2) \le 6$. Here we close the gap by showing that $\chi_o({\cal H}_2) \ge 6$.

Comments: 8 pages, 5 figures
Categories: math.CO
Subjects: 05C15, 05C85
Related articles: Most relevant | Search more
arXiv:2006.02998 [math.CO] (Published 2020-06-04)
4-cop-win graphs have at least 19 vertices
arXiv:2112.01910 [math.CO] (Published 2021-12-03, updated 2022-06-12)
Locating-dominating sets: from graphs to oriented graphs
arXiv:2105.04137 [math.CO] (Published 2021-05-10)
On the inversion number of oriented graphs