Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs

From MaRDI portal
Publication:4648784




Abstract: The oriented chromatic number of an oriented graph vecG is the minimum order of an oriented graph vevH such that vecG admits a homomorphism to vevH. The oriented chromatic number of an undirected graph G is then the greatest oriented chromatic number of its orientations. In this paper, we introduce the new notion of the upper oriented chromatic number of an undirected graph G, defined as the minimum order of an oriented graph vevU such that every orientation vecG of G admits a homomorphism to vecU. We give some properties of this parameter, derive some general upper bounds on the ordinary and upper oriented chromatic numbers of Cartesian, strong, direct and lexicographic products of graphs, and consider the particular case of products of paths.









This page was built for publication: Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648784)