On the Oriented Chromatic Index of Oriented Graphs

Pascal Ochem 1 Alexandre Pinlou 2, * Eric Sopena 3
* 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 a mapping f from the set of vertices of G to the set of vertices of H such that f(U)f(V) is an arc in H whenever uv is an arc in G. The oriented chromatic index of an oriented graph G is the minimum number of vertices in an oriented graph H such that there exists a homomorphism from the line digraph LD(G) of G to H. We give upper bounds for the oriented chromatic index of graphs with bounded acyclic chromatic number, of planar graphs and of graphs with bounded degree. We also consider lower and upper bounds of oriented chromatic number in terms of oriented chromatic index. We finally prove that the problem of deciding whether an oriented graph has oriented chromatic index at most k is polynomial time solvable if k<= 3 and is NP-complete if k>= 4.
Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00195956
Contributor : Alexandre Pinlou <>
Submitted on : Tuesday, December 11, 2007 - 5:54:40 PM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM

Links full text

Identifiers

Citation

Pascal Ochem, Alexandre Pinlou, Eric Sopena. On the Oriented Chromatic Index of Oriented Graphs. Journal of Graph Theory, Wiley, 2008, 57 (4), pp.313--332. ⟨10.1002/jgt.20286⟩. ⟨lirmm-00195956⟩

Share

Metrics

Record views

225