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 is the minimum order of an oriented graph such that admits a homomorphism to . The oriented chromatic number of an undirected graph 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 , defined as the minimum order of an oriented graph such that every orientation of admits a homomorphism to . 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.
Recommendations
Cited in
(5)- On the oriented coloring of the disjoint union of graphs
- Oriented chromatic number of Cartesian products and strong products of paths
- On the oriented achromatic number of graphs
- Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \)
- On the oriented coloring of the disjoint union of graphs
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)