Oriented chromatic number of Halin graphs
Discrete Mathematics
2019-09-04 v1 Combinatorics
Abstract
Oriented chromatic number of an oriented graph is the minimum order of an oriented graph such that admits a homomorphism to . The oriented chromatic number of an unoriented graph is the maximal chromatic number over all possible orientations of . 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.
Cite
@article{arxiv.1307.4901,
title = {Oriented chromatic number of Halin graphs},
author = {Janusz Dybizbański and Andrzej Szepietowski},
journal= {arXiv preprint arXiv:1307.4901},
year = {2019}
}