2604.01307 Oriented Chromatic Number of Planar Graphs Is at Most 67: Improving the Rashidi Bound
We present new results on oriented coloring with applications to planar graphs. Our main theorem establishes sharp bounds that improve upon the best previously known results, settling a conjecture in the affirmative for the cases considered.