Oriented colorings of partial 2-trees

A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(y) 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.

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Pascal Ochem, Alexandre Pinlou
• Keywords: Homomorphism, IPL 2008, Oriented Chromatic Number, Oriented Graph