T. Bartnicki, J. Grytczuk, and S. Niwczyk, Weight choosability of graphs, Journal of Graph Theory, vol.60, issue.3, pp.242-256, 2009.
DOI : 10.1002/jgt.20354

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.
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, pp.141-156, 2015.
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, pp.124-134, 2017.
DOI : 10.1016/j.ejc.2016.09.011
URL : https://hal.archives-ouvertes.fr/hal-01629938

J. Bensmail and G. Renault, Decomposing oriented graphs into six locally irregular oriented graphs, Graphs and Combinatorics, vol.32, pp.1707-1721, 2016.
DOI : 10.1007/s00373-016-1705-z
URL : http://orbit.dtu.dk/files/125619777/4.pdf

M. Kalkowski, A note on 1,2-Conjecture, 2009.
DOI : 10.1002/jgt.22100
URL : http://www.math.ucdenver.edu/%7Efpfender/papers/123Hyp.pdf

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, pp.347-349, 2010.
DOI : 10.1016/j.jctb.2009.06.002
URL : https://doi.org/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, pp.151-157, 2004.

B. Lu?ar, J. Przybyy-lo, and R. Soták, New bounds for locally irregular chromatic index of bipartite and subcubic graphs

J. Przybyy-lo, On decomposing graphs of large minimum degree into locally irregular subgraphs, Electronic Journal of Combinatorics, vol.23, issue.2, 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.

J. Przybyy-lo and M. Wo´zniakwo´zniak, Total weight choosability of graphs, Electronic Journal of Combinatorics, vol.18, issue.1, p.112, 2011.

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

T. Wong and X. Zhu, Every graph is (2, 3)-choosable, Combinatorics, vol.36, issue.1, pp.121-127, 2016.
DOI : 10.1007/s00493-014-3057-8