The oriented chromatic number of Halin graphs
We prove that every oriented Halin graph can be colored with at most 8 colors. Hence, the oriented chromatic number of the family of Halin graphs is equal to 8. This confirms the conjecture given by Vignal and solves an open problem presented by Sopena.
oriented chromatic number halin graph graph coloring oriented graph coloring combinatorial problems