V. Chvátal and C. Thomassen, Distances in orientations of graphs, Journal of Combinatorial Theory, Series B, vol.24, issue.1, pp.61-75, 1978.
DOI : 10.1016/0095-8956(78)90078-3

A. Kemnitz and I. Schiermeyer, Graphs with rainbow connection number two, Discussiones Mathematicae Graph Theory, pp.313-320, 2011.
DOI : 10.7151/dmgt.1547

W. F. Klostermeyer and G. Macgillivray, Analogues of cliques for oriented coloring, Discussiones Mathematicae Graph Theory, vol.24, issue.3, pp.373-387, 2004.
DOI : 10.7151/dmgt.1237

A. V. Kostochka, T. ?uczak, G. Simonyi, and . Sopena, On the minimum number of edges giving maximum oriented chromatic number, Dimacs/Dimatia conference " Contemporary Trends in Discrete Mathematics, pp.179-182, 1997.

L. Lovász, Coverings and coloring of hypergraphs, Proceedings of the 4th South-Eastern Conference on Combinatorics, Graph Theory, and Computing, pp.3-12, 1973.

A. Nandy, S. Sen, and . Sopena, Outerplanar and Planar Oriented Cliques, Journal of Graph Theory, vol.81, issue.6
DOI : 10.1002/jgt.21893
URL : https://hal.archives-ouvertes.fr/hal-01330534

R. Naserasr and E. Sopena, Homomorphisms of Signed Graphs, Journal of Graph Theory, vol.40, issue.3, pp.178-212, 2015.
DOI : 10.1002/jgt.21817
URL : https://hal.archives-ouvertes.fr/hal-00991796

H. E. Robbins, A Theorem on Graphs, with an Application to a Problem of Traffic Control, The American Mathematical Monthly, vol.46, issue.5, pp.281-283, 1939.
DOI : 10.2307/2303897

S. Sen, A contribution to the theory of graph homomorphisms and colorings, 10] ´ E. Sopena. Complete oriented colourings and the oriented achromatic number, pp.102-112, 2014.
URL : https://hal.archives-ouvertes.fr/tel-00960893

R. E. Tarjan, A note on finding the bridges of a graph, Information Processing Letters, vol.2, issue.6, pp.160-161, 1974.
DOI : 10.1016/0020-0190(74)90003-9