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.

O. Baudon, M. Pil?niak, J. Przyby?o, M. Senhaji, É. Sopena et al., Equitable neighbour-sum-distinguishing edge and total colourings, Discrete Applied Mathematics, vol.222, pp.40-53, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01433783

J. Bensmail, F. Mc-inerney, and K. Szabo-lyngsie, On {a, b}-edge-weightings of bipartite graphs with odd a, b
URL : https://hal.archives-ouvertes.fr/hal-01988399

J. Bensmail, B. Li, B. Li, and N. Nisse, On Minimizing the Maximum Color for the 1-2-3 Conjecture, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02330418

H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.1-2, pp.1-45, 1998.

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.

G. Chartrand, P. Erdös, and O. R. Oellermann, How to define an irregular graph, College Mathematics Journal, vol.19, issue.1, 1988.

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

A. Dudek and D. Wajc, On the complexity of verterx-coloring edge-weightings, Discrete Mathematics Theoretical Computer Science, vol.13, issue.3, pp.45-50, 2011.

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. Karo?ski, T. ?uczak, and A. Thomason, Edge weights and vertex colours, Journal of Combinatorial Theory, Series B, vol.91, pp.151-157, 2004.

H. Lu, Q. Yu, and C. Zhang, Vertex-colouring 2-edge-weightings of graphs, European Journal of Combinatorics, vol.32, pp.21-27, 2011.

W. Mulzer and G. Rote, Minimum-weight triangulation is NP-hard, Journal of the ACM, vol.55, issue.2, p.11, 2008.

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.

K. Szabo-lyngsie, On neighbour sum-distinguishing {0, 1}-weightings of bipartite graphs, Discrete Mathematics and Theoretical Computer Science, vol.20, issue.1, p.21, 2018.

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.