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

J. Edmonds, Paths, trees, and flowers, Journal canadien de math??matiques, vol.17, issue.0, pp.449-467, 1965.
DOI : 10.4153/CJM-1965-045-4

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, 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?ski, 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

W. Mulzer and G. Rote, Minimum-weight triangulation is NP-hard, Journal of the ACM, vol.55, issue.2, 2008.
DOI : 10.1145/1346330.1346336
URL : http://www.cs.princeton.edu/~wmulzer/mwt_TR_old.pdf

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