O. Baudon, J. Bensmail, J. Przybyy-lo, and M. Wo´zniakwo´zniak, On decomposing regular graphs into locally irregular subgraphs, European Journal of Combinatorics, vol.49, pp.90-104, 2015.
DOI : 10.1016/j.ejc.2015.02.031

O. Baudon, J. Bensmail, and ´. E. Sopena, On the complexity of determining the irregular chromatic index of a graph, Journal of Discrete Algorithms, vol.30, pp.113-127, 2015.
DOI : 10.1016/j.jda.2014.12.008
URL : https://hal.archives-ouvertes.fr/hal-00921849

O. Baudon, J. Bensmail, and ´. E. Sopena, An oriented version of the 1-2-3 Conjecture, Discussiones Mathematicae Graph Theory, vol.35, issue.1
DOI : 10.7151/dmgt.1791
URL : https://hal.archives-ouvertes.fr/hal-00849065

J. Bensmail, M. Merker, and C. Thomassen, Decomposing graphs into a constant number of locally irregular subgraphs, European Journal of Combinatorics, vol.60
DOI : 10.1016/j.ejc.2016.09.011

J. Bensmail and G. Renault, Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs, Graphs and Combinatorics, vol.91, issue.1, pp.1707-1721, 2016.
DOI : 10.1007/s00373-016-1705-z

M. Kalkowski, A note on 1,2-Conjecture, Electronic Journal of Combinatorics

M. Kalkowski, M. Karo´nskikaro´nski, and F. Pfender, Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture, Journal of Combinatorial Theory, Series B, vol.100, issue.3, pp.347-349, 2010.
DOI : 10.1016/j.jctb.2009.06.002

M. Karo´nskikaro´nski, T. Luczak, and A. Thomason, Edge weights and vertex colours, Journal of Combinatorial Theory, Series B, vol.91, issue.1, pp.151-157, 2004.
DOI : 10.1016/j.jctb.2003.12.001

J. Przybyy-lo, On decomposing graphs of large minimum degree into locally irregular subgraphs, Electronic Journal of Combinatorics, vol.23, issue.2, pp.2-31, 2016.

J. Przybyy-lo and M. Wo´zniakwo´zniak, On a 1,2 conjecture, Discrete Mathematics and Theoretical Computer Science, vol.12, issue.1, pp.101-108, 2010.

B. Seamone, The 1-2-3 conjecture and related problems: a survey