]. P. Balister, O. M. Riordan, and R. H. Schelp, Vertex-distinguishing edge colorings of graphs, Journal of Graph Theory, vol.176, issue.2, pp.95-109, 2003.
DOI : 10.1002/jgt.10076

J. A. Bondy, Induced subsets, Journal of Combinatorial Theory, Series B, vol.12, issue.2, pp.201-202, 1972.
DOI : 10.1016/0095-8956(72)90025-1
URL : http://doi.org/10.1016/0095-8956(72)90025-1

A. C. Burris and R. H. Schelp, Vertex-distinguishing proper edge-colorings, Journal of Graph Theory, vol.26, issue.2
DOI : 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C

G. Chartrand, D. Erwin, M. A. Henning, P. J. Slater, and P. Zhang, The locating-chromatic number of a graph, Bull. Inst. Combin. Appl, vol.36, pp.89-101, 2002.

J. Cern´ycern´y, M. Hor?ák, and R. Soták, Observability of a graph, Math. Slovaca, vol.46, issue.1, pp.21-31, 1996.

L. Esperet, S. Gravier, M. Montassier, P. Ochem, and A. Parreau, Locally identifying coloring of graphs, Electron. J. Combin, vol.19, issue.2, p.2012
URL : https://hal.archives-ouvertes.fr/hal-00529640

F. Foucaud, I. Honkala, T. Laihonen, A. Parreau, and G. Perarnau, Locally identifying colourings for graphs with given maximum degree, Discrete Mathematics, vol.312, issue.10, pp.312-2012
DOI : 10.1016/j.disc.2012.01.034
URL : https://hal.archives-ouvertes.fr/hal-00614513

M. G. Karpovsky, K. Chakrabarty, and L. B. Levitin, On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, issue.2, pp.599-611, 1998.
DOI : 10.1109/18.661507

A. Lobstein, Identifying and locating-dominating codes in graphs, a bibliography

J. Ne?est?il, P. Ossona, and . Mendez, Grad and classes with bounded expansion I. Decompositions, European Journal of Combinatorics, vol.29, issue.3, pp.760-776, 2008.
DOI : 10.1016/j.ejc.2006.07.013