Geodesic
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 1, pp. 211-223

Voir la notice de l'article provenant de la source Library of Science

An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph. In this paper, we focus on oriented col- orings of Cartesian products of two paths, called grids, and strong products of two paths, called strong-grids. We show that there exists a coloring graph with nine vertices that can be used to color every orientation of grids with five columns. We also show that there exists a strong-grid with two columns and its orientation which requires 11 colors for oriented coloring. Moreover, we show that every orientation of every strong-grid with three columns can be colored by 19 colors and that every orientation of every strong-grid with four columns can be colored by 43 colors. The above statements were proved with the help of computer programs.
Keywords: graph, oriented coloring, grid 
@article{DMGT_2019_39_1_a16,
     author = {Dybizba\'nski, Janusz and Nenca, Anna},
     title = {Oriented {Chromatic} {Number} of {Cartesian} {Products} and {Strong} {Products} of {Paths}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {211--223},
     publisher = {mathdoc},
     volume = {39},
     number = {1},
     year = {2019},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2019_39_1_a16/}
}
TY  - JOUR
AU  - Dybizbański, Janusz
AU  - Nenca, Anna
TI  - Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2019
SP  - 211
EP  - 223
VL  - 39
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2019_39_1_a16/
LA  - en
ID  - DMGT_2019_39_1_a16
ER  - 
%0 Journal Article
%A Dybizbański, Janusz
%A Nenca, Anna
%T Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
%J Discussiones Mathematicae. Graph Theory
%D 2019
%P 211-223
%V 39
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2019_39_1_a16/
%G en
%F DMGT_2019_39_1_a16
Dybizbański, Janusz; Nenca, Anna. Oriented Chromatic Number of Cartesian Products and Strong Products of Paths. Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 1, pp. 211-223. http://geodesic.mathdoc.fr/item/DMGT_2019_39_1_a16/