P. N. Balister, E. Gy?-ori, J. Lehel, and R. H. Schelp, Adjacent Vertex Distinguishing Edge???Colorings, SIAM Journal on Discrete Mathematics, vol.21, issue.1, pp.237-250, 2007.
DOI : 10.1137/S0895480102414107
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.485.1603

K. Edwards, M. Hor?ák, and M. Wo´zniakwo´zniak, On the Neighbour-Distinguishing Index of a Graph, Graphs and Combinatorics, vol.22, issue.3, pp.341-350, 2006.
DOI : 10.1007/s00373-006-0671-2

H. Fleischner and M. Stiebitz, A solution to a colouring problem of P. Erd? os, Discrete Math, pp.39-48, 1992.

E. Gy?-ori, M. Hor?ák, C. Palmer, and M. Wo´zniakwo´zniak, General neighbour-distinguishing index of a graph, pp.827-831, 2008.

E. Gy?-ori and C. Palmer, A new type of edge-derived vertex colorings, Discrete Math, pp.6344-6352, 2009.

M. Hor?ák and R. Soták, General neighbour-distinguishing index via chromatic number, Discrete Math, pp.310-1733, 2010.

J. C. Janssen, The Dinitz Problem Solved for Rectangles, Bulletin of the American Mathematical Society, vol.29, issue.2, pp.243-249, 1993.
DOI : 10.1090/S0273-0979-1993-00430-0

. Zs and . Tuza, Graph colorings with local constraints?a survey, Discuss. Math. Graph Theory, vol.17, pp.161-228, 1997.

Z. Zhang, L. Liu, and J. Wang, Adjacent strong edge coloring of graphs, Applied Mathematics Letters, vol.15, issue.5, pp.623-626, 2002.
DOI : 10.1016/S0893-9659(02)80015-5