N. Alon, G. Kaplan, A. Lev, Y. Roditty, and R. Yuster, Dense graphs are antimagic, Journal of Graph Theory, vol.47, issue.4, pp.297-309, 2004.
DOI : 10.1002/0471722154

URL : http://arxiv.org/abs/math/0304198

S. Arumugam, K. Premalatha, M. Ba?a, and A. Semani?ová-fe?ov?íková, Local Antimagic Vertex Coloring of a Graph, Graphs and Combinatorics, vol.66, issue.1, pp.275-285, 2017.
DOI : 10.1016/S0012-365X(99)00041-2

O. Baudon, M. Pil´sniakpil´sniak, J. Przyby?o, M. Senhaji, E. Sopena et al., Equitable neighbour-sum-distinguishing edge and total colourings, Discrete Applied Mathematics, vol.222, pp.40-53, 2017.
DOI : 10.1016/j.dam.2017.01.031

URL : https://hal.archives-ouvertes.fr/hal-01433783

K. Bérci, A. Bernáth, and M. Vizer, Regular graphs are antimagic, Electronic Journal of Combinatorics, vol.22, issue.3, p.2015

O. Borodin, A. Kostochka, J. Ne?et?il, A. Raspaud, and E. Sopena, On the maximum average degree and the oriented chromatic number of a graph, Discrete Mathematics, vol.206, issue.1-3, pp.77-89, 1999.
DOI : 10.1016/S0012-365X(98)00393-8

URL : https://hal.archives-ouvertes.fr/hal-00306484

D. Cranston, Y. Liang, and X. Zhu, Regular Graphs of Odd Degree Are Antimagic, Journal of Graph Theory, vol.72, issue.1, pp.28-33, 2015.
DOI : 10.1002/jgt.21664

J. Gallian, A dynamic survey of graph labeling, Journal of Graph Theory, p.6, 1997.

N. Hartsfield and G. , Pearls in Graph Theory, 1990.

M. Kalkowski, M. Karo´nskikaro´nski, 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 : http://doi.org/10.1016/j.jctb.2009.06.002

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

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