K. Appel, W. Haken, and J. Koch, Every planar map is four colorable. Part rm II: Reducibility, Illinois J. Math, vol.21, pp.491-567, 1977.

J. Bang-jensen, P. Hell, and G. Macgillivray, The complexity of colouring by semicomplete digraphs, SIAM J. Discrete Math, vol.1, pp.281-298, 1988.

L. Barto, M. Kozik, and T. Niven, The CSP dichotomy holds for digraphs with no sources and no sinks, SIAM J. Comput, vol.38, pp.1782-1802, 2009.

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

J. A. Bondy and U. S. Murty, Graph Theory, 2008.

R. A. Brualdi and J. J. Quinn-massey, Incidence and strong edge colorings of graphs, Discrete Math, vol.122, issue.93, pp.90286-90289, 1993.

B. Courcelle, The monadic second order logic of graphs VI: on several representations of graphs by relational structures, Discrete Appl. Math, vol.54, pp.90019-90020, 1994.

W. D. Fellner, On minimal graphs, Theoret. Comput. Sci, vol.17, pp.103-110, 1982.

, Oriented Incidence Colourings of Digraphs, vol.207

R. L. Graham and N. J. Sloane, Lower bounds for constant weight codes, IEEE Trans. Inform. Theory, vol.26, pp.37-43, 1980.

P. Hell and J. Ne?et?il, On the complexity of H-coloring, J. Combin. Theory Ser. B, vol.48, pp.92-110, 1990.

M. Hosseini-dolama, E. Sopena, and X. Zhu, Incidence coloring of k-degenerated graphs, Discrete Math, vol.283, pp.121-128, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00307542

W. Klostermeyer and G. Macgillivray, Homomorphisms and oriented colorings of equivalence classes of oriented graphs, Discrete Math, vol.274, pp.161-172, 2004.

A. V. Kostochka, E. Sopena, and X. Zhu, Acyclic and oriented chromatic numbers of graphs, J. Graph Theory, vol.24, pp.331-340, 1997.

G. Macgillivray and K. Sherk, A theory of 2-dipath colourings, Australas. J. Combin, vol.60, pp.11-26, 2014.

G. Macgillivray and J. S. Swarts, Obstructions to homomorphisms involving the graft extension

T. H. Marshall, Homomorphism bounds for oriented planar graphs, J. Graph Theory, vol.55, pp.175-190, 2007.

J. Ne?et?il and A. Pultr, On classes of relations and graphs determined by subobjects and factorobjects, Discrete Math, vol.22, pp.90062-90068, 1978.

S. Sen, Maximum order of a planar oclique is 15, Proc. 23rd International Workshop on Combinatorial Algorithms, pp.130-142, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00959799

E. Sopena, Oriented graph coloring, Discrete Math, vol.229, pp.359-369, 2001.
DOI : 10.1016/s0012-365x(00)00216-8
URL : https://doi.org/10.1016/s0012-365x(00)00216-8

P. K. Sun, Incidence coloring of regular graphs and complement graphs, Taiwanese J. Math, vol.16, pp.2289-2295, 2012.

E. , Color-families are dense, Theoret. Comput. Sci, vol.17, pp.29-41, 1982.

J. Wu, Some results on the incidence coloring number of a graph, Discrete Math, vol.309, pp.3866-3870, 2009.

C. Duffy, G. Macgillivray, P. Ochem, and A. Raspaud,

K. Young, 2-Dipath and Proper 2-Dipath Colouring, 2009.