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, 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.

Y. Duan, H. Lu, and Q. Yu, L-Factors and Adjacent Vertex-Distinguishing EdgeWeighting, East Asian Journal on Applied Mathematics, vol.2, issue.2, pp.83-93, 2012.

A. Dudek and D. Wajc, On the complexity of vertex-coloring edge-weightings, Discrete Mathematics Theoretical Computer Science, vol.13, issue.3, pp.45-50, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00990502

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 1,2-Conjecture, 2009.

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.

J. Przyby?o and M. Wo?niak, On a 1,2 Conjecture, Discrete Mathematics and Theoretical Computer Science, vol.12, issue.1, pp.101-108, 2010.

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.