2000 character limit reached
Oriented chromatic number of Halin graphs (1307.4901v1)
Published 18 Jul 2013 in cs.DM and math.CO
Abstract: Oriented chromatic number of an oriented graph $G$ is the minimum order of an oriented graph $H$ such that $G$ admits a homomorphism to $H$. The oriented chromatic number of an unoriented graph $G$ is the maximal chromatic number over all possible orientations of $G$. In this paper, we prove that every Halin graph has oriented chromatic number at most 8, improving a previous bound by Hosseini Dolama and Sopena, and confirming the conjecture given by Vignal.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.