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.

O. Baudon, J. Bensmail, T. Davot, H. Hocquard, J. Przyby?o et al., A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions, Discrete Mathematics and Theoretical Computer Science, vol.21, issue.1, p.2, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02264673

O. Baudon, J. Bensmail, H. Hocquard, M. Senhaji, and É. Sopena, Edge Weights and Vertex Colours: Minimizing Sum Count, Discrete Applied Mathematics, vol.270, pp.13-24, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01839537

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

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

J. Bensmail, H. Hocquard, D. Lajou, and É. Sopena, Further Evidence Towards the Multiplicative 1-2-3 Conjecture, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02546401

J. Bensmail and J. Przyby?o, Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture, Discrete Applied Mathematics, vol.268, pp.1-9, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02288797

G. Chartrand, M. S. Jacobson, J. Lehel, O. R. Oellermann, S. Ruiz et al., Irregular networks. Congressus Numerantium, vol.64, pp.197-210, 1988.

J. A. Gallian, A dynamic survey of graph labeling, Electronic Journal of Combinatorics, vol.6, 1998.

Y. Gao, G. Wang, and J. Wu, A Relaxed Case on 1-2-3 Conjecture. Graphs and Combinatorics, vol.32, pp.1415-1421, 2016.

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

M. Kalkowski, M. Karo?ski, 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.

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

M. Karo?ski, T. ?uczak, and A. Thomason, Edge weights and vertex colours, Journal of Combinatorial Theory, Series B, vol.91, pp.151-157, 2004.

J. Przyby?o, A note on the weak (2, 2)-Conjecture, Discrete Mathematics, vol.342, issue.2, pp.498-504, 2019.

J. Przyby?o, The 1-2-3 Conjecture almost holds for regular graphs, 2018.

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

B. Vu?kovi?, Multi-set neighbor distinguishing 3-edge coloring, Discrete Mathematics, vol.341, pp.820-824, 2018.