E. Andrews, C. Lumduanhom, E. Laforge, and P. Zhang, On proper-path colorings in graphs, J. Comb. Math. and Comb. Comp, vol.97, pp.189-207, 2016.

V. Borozan, S. Fujita, A. Gerek, C. Magnant, Y. Manoussakis et al., Proper connection of graphs, Discrete Mathematics, vol.312, issue.17, pp.312-2550, 2012.
DOI : 10.1016/j.disc.2011.09.003

URL : https://hal.archives-ouvertes.fr/hal-01128777

S. Chakraborty, E. Fischer, A. Matsliah, and R. Yuster, Hardness and algorithms for rainbow connection, Journal of Combinatorial Optimization, vol.133, issue.1, pp.330-347, 2011.
DOI : 10.1016/S0020-0190(96)00190-1

H. Chang, Z. Huang, and X. Li, Degree sum conditions for graphs to have proper connection number 2, p.arXiv, 2016.

G. Chartrand, G. L. Johns, K. A. Mckeon, and P. Zhang, Rainbow connection in graphs, Mathematica Bohemica, vol.133, pp.85-98, 2008.

E. Chizmar, C. Magnant, and P. Salehi-nowbandegani, Note on vertex and total proper connection numbers, AKCE International Journal of Graphs and Combinatorics, vol.13, issue.2, pp.103-106, 2016.
DOI : 10.1016/j.akcej.2016.06.003

D. Dorninger, Hamiltonian circuits determining the order of chromosomes, Discrete Applied Mathematics, vol.50, issue.2, pp.159-168, 1994.
DOI : 10.1016/0166-218X(92)00171-H

A. Gerek, S. Fujita, and C. Magnant, Proper connection with many colors, J. of Combinatorics, vol.3, pp.683-693, 2012.

R. Gu, X. Li, and Z. Qin, Proper connection number of random graphs, Theoretical Computer Science, vol.609, pp.336-343, 2016.
DOI : 10.1016/j.tcs.2015.10.017

F. Huang and X. Li, Qin and C. Magnant, Minimum degree condition for proper connection number 2, Theoretical Computer Science, 2016.

F. Huang, X. Li, and S. Wang, Proper connection number and 2-proper connection number of a graph, 2015.

X. Li and C. Magnant, Properly colored notions of connectivity - a dynamic survey, Theory and Applications of Graphs, vol.0, issue.1, p.2, 2015.
DOI : 10.20429/tag.2015.000102

X. Li, M. Wei, and J. Yue, Proper connection number and connected dominating sets, Theoretical Computer Science, vol.607, pp.480-487, 2015.
DOI : 10.1016/j.tcs.2015.06.006

C. Lumduanhom, E. Laforge, and P. Zhang, Characterizations of graphs having large proper connection numbers, Discussiones Mathematicae Graph Theory, vol.36, pp.439-453, 2016.

C. Magnant, P. R. Morley, S. Porter, P. S. Nowbandegani, and H. Wang, Directed proper connection of graphs, pp.68-58, 2016.

W. Mccuaig, Even dicycles, Journal of Graph Theory, vol.10, issue.1, pp.46-68, 2015.
DOI : 10.2140/pjm.1960.10.1067

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