Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Antoni Lozano (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: