A. Dehghan, M. Sadeghi, and A. Ahadi, Algorithmic complexity of proper labeling problems, Theoretical Computer Science, vol.495, pp.25-36, 2013.
DOI : 10.1016/j.tcs.2013.05.027

O. Baudon, J. Bensmail, J. Przybyy, and M. Wo´zniakwo´zniak, On decomposing regular graphs into locally irregular subgraphs, European Journal of Combinatorics, vol.49, pp.90-104, 2015.
DOI : 10.1016/j.ejc.2015.02.031

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

J. Bensmail, M. Merker, and C. Thomassen, Decomposing graphs into a constant number of locally irregular subgraphs, European Journal of Combinatorics, vol.60, pp.124-134, 2017.
DOI : 10.1016/j.ejc.2016.09.011

J. Bensmail and B. Stevens, Edge-partitioning graphs into regular and locally irregular components, Discrete Mathematics and Theoretical Computer Science, vol.17, issue.3, pp.43-58, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01058019

M. Karo´nskikaro´nski, T. Luczak, 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

B. Lu?ar, J. Przybyy, and R. Soták, New bounds for locally irregular chromatic index of bipartite and subcubic graphs

J. Przybyy-lo, On decomposing graphs of large minimum degree into locally irregular subgraphs, Electronic Journal of Combinatorics, vol.23, issue.2, pp.2-31, 2016.

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