The Oriented Chromatic Number of the Hexagonal Grid is 6
Abstract
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 o( F) of a graph family F is the maximum oriented chromatic number over any orientation of any graph in F. For the family of hexagonal grids H2, Bielak (2006) proved that 5 o( H2) 6. Here we close the gap by showing that o( H2) 6.
0