Strong Oriented Chromatic Number of Planar Graphs without Short Cycles

Mickaël Montassier 1, 2 Pascal Ochem 3 Alexandre Pinlou 2, *
* Corresponding author
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mapping f from V(G) to M such that f(u) <> j(v) whenever uv is an arc in G and f(v)−f(u) <> −(f(t)−f(z)) whenever uv and zt are two arcs in G. The strong oriented chromatic number of an oriented graph is the minimal order of a group M such that G has an M-strong-oriented coloring. This notion was introduced by Nesetril and Raspaud [Ann. Inst. Fourier, 49(3):1037-1056, 1999]. We prove that the strong oriented chromatic number of oriented planar graphs without cycles of lengths 4 to 12 (resp. 4 or 6) is at most 7 (resp. 19). Moreover, for all i ≥ 4, we construct outerplanar graphs without cycles of lengths 4 to i whose oriented chromatic number is 7.
Keywords : Graphs Algorithms
Document type :
Journal articles
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00184811
Contributor : Alexandre Pinlou <>
Submitted on : Tuesday, June 3, 2014 - 3:20:47 PM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM
Long-term archiving on : Wednesday, September 3, 2014 - 10:35:35 AM

File

455-2688-2-PB.pdf
Explicit agreement for this submission

Identifiers

  • HAL Id : lirmm-00184811, version 1

Citation

Mickaël Montassier, Pascal Ochem, Alexandre Pinlou. Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (1), pp.1-24. ⟨lirmm-00184811⟩

Share

Metrics

Record views

528

Files downloads

734