J. Bensmail, C. Duffy, and S. Sen, Analogues of cliques for (m, n)-colored mixed graphs, Graphs and Combinatorics, vol.33, issue.4, pp.735-750, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01078218

J. Dybizba?ski and A. Nenca, Oriented chromatic number of grids is greater than 7, Information Processing Letters, vol.112, issue.4, pp.113-117, 2012.

G. Fertin, E. Godard, and A. Raspaud, Acyclic and k-distance coloring of the grid, Information Processing Letters, vol.87, issue.1, pp.51-58, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00307787

G. Fertin, A. Raspaud, and A. Roychowdhury, On the oriented chromatic number of grids. Information Processing Letters, vol.85, pp.261-266, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00307790

J. Ne?et?il and A. Raspaud, Colored Homomorphisms of Colored Mixed Graphs, Journal of Combinatorial Theory, Series B, vol.80, issue.1, pp.147-155, 2000.

S. Sen, A contribution to the theory of graph homomorphisms and colorings, 2014.
URL : https://hal.archives-ouvertes.fr/tel-00960893

É. Sopena, Homomorphisms and colourings of oriented graphs: An updated survey, Discrete Mathematics, vol.339, 1993.
URL : https://hal.archives-ouvertes.fr/hal-01330535

A. Szepietowski and M. Targan, A note on the oriented chromatic number of grids, Information Processing Letters, vol.92, issue.2, pp.65-70, 2004.