L. Addario-berry, R. E. Aldred, K. Dalal, and B. A. Reed, Vertex colouring edge partitions, Journal of Combinatorial Theory, Series B, vol.94, issue.2, pp.237-244, 2005.
DOI : 10.1016/j.jctb.2005.01.001
URL : https://doi.org/10.1016/j.jctb.2005.01.001

A. Ahadi, A. Dehghan, and M. Sadeghi, Algorithmic complexity of proper labeling problems, Theoretical Computer Science, vol.495, pp.25-36, 2013.

O. Baudon, J. Bensmail, J. Przyby?o, 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 É. 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

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

A. Dudek and D. Wajc, On the complexity of vertex-coloring edge-weightings, pp.45-50, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00990502

G. J. Chang, C. Lu, J. Wu, and Q. Yu, Vertex-coloring Edge-weightings of Graphs, Taiwanese Journal of Mathematics, vol.15, issue.4, pp.1807-1813, 2011.
DOI : 10.11650/twjm/1500406380

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
URL : https://doi.org/10.1016/j.jctb.2009.06.002

M. Karo´nskikaro´nski, T. ?uczak, 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

B. Lu?ar, J. Przyby?o, and R. Soták, New bounds for locally irregular chromatic index of bipartite and subcubic graphs, Journal of Combinatorial Optimization, vol.23, issue.1
DOI : 10.1007/s10878-017-0178-1

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

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

C. Thomassen, Y. Wu, and C. Zhang, The 3-flow conjecture, factors modulo k , and the 1-2-3-conjecture, Journal of Combinatorial Theory, Series B, vol.121, pp.308-325, 2016.
DOI : 10.1016/j.jctb.2016.06.010
URL : https://manuscript.elsevier.com/S009589561630051X/pdf/S009589561630051X.pdf