Oriented colorings of partial 2-trees

Pascal Ochem, Alexandre Pinlou
2008 Information Processing Letters  
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from is an arc in H whenever xy is an arc in G. The oriented chromatic number of G is the minimum order of an oriented graph H such that G has a homomorphism to H. In this paper, we determine the oriented chromatic number of the class of partial 2-trees for every girth g ≥ 3.
doi:10.1016/j.ipl.2008.04.007 fatcat:4htgdj7nwndopoj4s3d2k2jx4a