Geodesic
On the oriented game chromatic number
The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We consider the oriented version of a coloring game introduced by Bodlaender [On the complexity of some coloring games, Internat. J. Found. Comput. Sci. 2 (1991), 133–147]. We prove that every oriented path has oriented game chromatic number at most 7 (and this bound is tight), that every oriented tree has oriented game chromatic number at most 19 and that there exists a constant $t$ such that every oriented outerplanar graph has oriented game chromatic number at most $t$.
DOI : 10.37236/1613
Classification : 05C15, 68R05
Mots-clés : oriented graph coloring, coloring games 
@article{10_37236_1613,
     author = {J. Ne\v{s}et\v{r}il and E. Sopena},
     title = {On the oriented game chromatic number},
     journal = {The electronic journal of combinatorics},
     year = {2001},
     volume = {8},
     number = {2},
     doi = {10.37236/1613},
     zbl = {0982.05049},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1613/}
}
TY  - JOUR
AU  - J. Nešetřil
AU  - E. Sopena
TI  - On the oriented game chromatic number
JO  - The electronic journal of combinatorics
PY  - 2001
VL  - 8
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1613/
DO  - 10.37236/1613
ID  - 10_37236_1613
ER  - 
%0 Journal Article
%A J. Nešetřil
%A E. Sopena
%T On the oriented game chromatic number
%J The electronic journal of combinatorics
%D 2001
%V 8
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1613/
%R 10.37236/1613
%F 10_37236_1613
J. Nešetřil; E. Sopena. On the oriented game chromatic number. The electronic journal of combinatorics, The Fraenkel Festschrift volume, Tome 8 (2001) no. 2. doi: 10.37236/1613

Cité par Sources :