Geodesic
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles
Discrete mathematics & theoretical computer science, Tome 10 (2007-2008) no. 1.

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2008_10_1_a1,
     author = {Montassier, Mickael and Ochem, Pascal and Pinlou, Alexandre},
     title = {Strong {Oriented} {Chromatic} {Number} of {Planar} {Graphs} without {Short} {Cycles}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {10},
     number = {1},
     year = {2007-2008},
     doi = {10.46298/dmtcs.418},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.418/}
}
TY  - JOUR
AU  - Montassier, Mickael
AU  - Ochem, Pascal
AU  - Pinlou, Alexandre
TI  - Strong Oriented Chromatic Number of Planar Graphs without Short Cycles
JO  - Discrete mathematics & theoretical computer science
PY  - 2007-2008
VL  - 10
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.418/
DO  - 10.46298/dmtcs.418
LA  - en
ID  - DMTCS_2008_10_1_a1
ER  - 
%0 Journal Article
%A Montassier, Mickael
%A Ochem, Pascal
%A Pinlou, Alexandre
%T Strong Oriented Chromatic Number of Planar Graphs without Short Cycles
%J Discrete mathematics & theoretical computer science
%D 2007-2008
%V 10
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.418/
%R 10.46298/dmtcs.418
%G en
%F DMTCS_2008_10_1_a1
Montassier, Mickael; Ochem, Pascal; Pinlou, Alexandre. Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discrete mathematics & theoretical computer science, Tome 10 (2007-2008) no. 1. doi : 10.46298/dmtcs.418. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.418/

Cité par Sources :