L. Addario-berry, K. Dalal, C. Mcdiarmid, B. A. Reed, and A. Thomason, Vertex-Colouring EdgeWeightings, vol.27, pp.1-12, 2007.

L. Addario-berry, K. Dalal, and B. A. Reed, Degree Constrained Subgraphs, Discrete Appl. Math, vol.156, issue.7, pp.1168-1174, 2008.

M. Aigner and E. Triesch, Irregular assignments of trees and forests, SIAM J. Discrete Math, vol.3, issue.4, pp.439-449, 1990.

N. Alon and J. H. Spencer, The Probabilistic Method, 2000.

O. Baudon, J. Bensmail, J. Przyby-lo, and M. Wo?niak, On decomposing regular graphs into locally irregular subgraphs, European J. Combin, vol.49, pp.90-104, 2015.

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

O. Baudon, J. Bensmail, T. Davot, J. Hocquard, M. Przyby-lo et al., A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
URL : https://hal.archives-ouvertes.fr/hal-02264673

J. Bensmail, A 1-2-3-4 result for the 1-2-3 Conjecture in 5-regular graphs, Discrete Appl. Math, vol.257, pp.31-39, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01509365

J. Bensmail, M. Merker, and C. Thomassen, Decomposing graphs into a constant number of locally irregular subgraphs, European J. Combin, vol.60, pp.124-134, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01629938

G. Chartrand, P. Erd?s, and O. R. Oellermann, How to Define an Irregular Graph, College Math. J, vol.19, issue.1, pp.36-42, 1988.

G. Chartrand, M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz et al., Congr. Numer, vol.64, pp.197-210, 1988.

B. Cuckler and F. Lazebnik, Irregularity Strength of Dense Graphs, J. Graph Theory, vol.58, issue.4, pp.299-313, 2008.

R. J. Faudree, M. S. Jacobson, J. Lehel, and R. Schelp, Irregular networks, regular graphs and integer matrices with distinct row and column sums, Discrete Math, vol.76, pp.223-240, 1989.

R. J. Faudree and J. Lehel, Bound on the irregularity strength of regular graphs, Colloq Math Soc Ja?os Bolyai, vol.52, pp.247-256, 1987.

A. Frieze, R. J. Gould, M. Karo?ski, and F. Pfender, On Graph Irregularity Strength, J. Graph Theory, vol.41, issue.2, pp.120-137, 2002.

S. Janson, T. Luczak, and A. Ruci?ski, Random Graphs, 2000.

M. Kalkowski, A note on 1,2-Conjecture, 2009.

M. Kalkowski, M. Karo?ski, and F. Pfender, A new upper bound for the irregularity strength of graphs, SIAM J. Discrete Math, vol.25, pp.1319-1321, 2011.

M. Kalkowski, M. Karo?ski, and F. Pfender, Vertex-coloring edge-weightings: Towards the 1-2-3 conjecture, J. Combin. Theory Ser. B, vol.100, pp.347-349, 2010.

M. Karo?ski, T. Luczak, and A. Thomason, Edge weights and vertex colours, J. Combin. Theory Ser. B, vol.91, pp.151-157, 2004.

J. Lehel, Facts and quests on degree irregular assignments, Graph Theory, Combinatorics and Applications, pp.765-782, 1991.

B. Lu?ar, J. Przyby-lo, and R. Soták, New bounds for locally irregular chromatic index of bipartite and subcubic graphs, J. Comb. Optim, vol.36, issue.4, pp.1425-1438, 2018.

P. Majerski, J. Przyby, and . Lo, On the irregularity strength of dense graphs, SIAM J. Discrete Math, vol.28, issue.1, pp.197-205, 2014.

M. Molloy and B. Reed, Graph Colouring and the Probabilistic Method, 2002.

T. Nierhoff, A tight bound on the irregularity strength of graphs, SIAM J. Discrete Math, vol.13, issue.3, pp.313-323, 2000.

J. Lo, Irregularity strength of regular graphs, Electron. J. Combin, vol.15, issue.1, p.82, 2008.

J. Lo, Linear bound on the irregularity strength and the total vertex irregularity strength of graphs, SIAM J. Discrete Math, vol.23, issue.1, pp.511-516, 2009.

J. Lo, On decomposing graphs of large minimum degree into locally irregular subgraphs, Electron. J. Combin, vol.23, issue.2, p.31, 2016.

J. Przyby-lo and M. Wo?niak, On a 1,2 Conjecture, Discrete Math. Theor. Comput. Sci, vol.12, issue.1, pp.101-108, 2010.

C. Thomassen, Y. Wu, and C. Q. Zhang, The 3-flow conjecture, factors modulo k, and the 1-2-3 conjecture, J. Combin. Theory Ser. B, vol.121, pp.308-325, 2016.

T. Wang and Q. Yu, On vertex-coloring 13-edge-weighting, Front. Math. China, vol.3, issue.4, pp.581-587, 2008.