Skip to Main content Skip to Navigation

Oriented Colorings of Partial 2-trees

Pascal Ochem 1 Alexandre Pinlou 2, * 
* Corresponding author
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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.
Document type :
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Alexandre Pinlou Connect in order to contact the contributor
Submitted on : Friday, November 23, 2007 - 10:06:19 AM
Last modification on : Tuesday, September 6, 2022 - 4:52:15 PM
Long-term archiving on: : Monday, April 12, 2010 - 4:45:45 AM


  • HAL Id : lirmm-00190875, version 1


Pascal Ochem, Alexandre Pinlou. Oriented Colorings of Partial 2-trees. RR-07026, 2007, pp.7. ⟨lirmm-00190875⟩



Record views


Files downloads