. Graphes and . Gauthier-villars, English translation: Graphs, 1983.

N. Bertrand, Codes identifiants et codes localisateurs-dominateurs sur certains graphes, p.28, 2001.

N. Bertrand, I. Charon, O. Hudry, and A. Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics, vol.25, issue.7, pp.969-987, 2004.
DOI : 10.1016/j.ejc.2003.12.013

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, Structural properties of twin-free graphs, Electronic Journal of Combinatorics, vol.14, issue.1, p.16, 2007.

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, Minimum sizes of identifying codes in graphs differing by one edge, Cryptography and Communications, vol.29, issue.1
DOI : 10.1007/s12095-013-0094-x
URL : https://hal.archives-ouvertes.fr/hal-00731811

I. Charon, I. Honkala, O. Hudry, and A. Lobstein, Minimum sizes of identifying codes in graphs differing by one vertex, Cryptography and Communications, vol.29, issue.1
DOI : 10.1007/s12095-012-0078-2
URL : https://hal.archives-ouvertes.fr/hal-00731811

I. Charon, O. Hudry, and A. Lobstein, Extremal cardinalities for identifying and locating-dominating codes in graphs, Discrete Mathematics, vol.307, issue.3-5, p.18, 2003.
DOI : 10.1016/j.disc.2005.09.027

I. Charon, O. Hudry, and A. Lobstein, On the Structure of Identifiable Graphs, Electronic Notes in Discrete Mathematics, vol.22, pp.491-495, 2005.
DOI : 10.1016/j.endm.2005.06.094

I. Charon, O. Hudry, and A. Lobstein, Possible cardinalities for identifying codes in graphs, Australasian Journal of Combinatorics, vol.32, pp.177-195, 2005.

I. Charon, O. Hudry, and A. Lobstein, Extremal cardinalities for identifying and locating-dominating codes in graphs, Discrete Mathematics, vol.307, issue.3-5, pp.356-366, 2007.
DOI : 10.1016/j.disc.2005.09.027

C. Chen, C. Lu, and Z. Miao, Identifying codes and locating???dominating sets on paths and cycles, Discrete Applied Mathematics, vol.159, issue.15, pp.1540-1547, 2011.
DOI : 10.1016/j.dam.2011.06.008
URL : http://doi.org/10.1016/j.dam.2011.06.008

R. Diestel, Graph Theory, 2005.

F. Foucaud, E. Guerrini, M. Kov?ekov?kov?e, R. Naserasr, A. Par-reau et al., Extremal graphs for the identifying code problem, European Journal of Combinatorics, vol.32, issue.4, pp.628-638, 2011.
DOI : 10.1016/j.ejc.2011.01.002
URL : https://hal.archives-ouvertes.fr/hal-00477467

S. Gravier and J. Moncel, On graphs having a <mml:math altimg="si3.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>V</mml:mi><mml:mo>???</mml:mo><mml:mo stretchy="false">{</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">}</mml:mo></mml:math> set as an identifying code, Discrete Mathematics, vol.307, issue.3-5, pp.432-434, 2007.
DOI : 10.1016/j.disc.2005.09.035

I. Honkala, An Optimal Edge-Robust Identifying Code in the Triangular Lattice, Annals of Combinatorics, vol.8, issue.3, pp.303-323, 2004.
DOI : 10.1007/s00026-004-0222-6

I. Honkala, On 2-edge-robust r-identifying codes in the king grid, Australasian Journal of Combinatorics, vol.36, pp.151-165, 2006.

I. Honkala and T. Laihonen, On identifying codes that are robust against edge changes, Information and Computation, vol.205, issue.7, pp.1078-1095, 2007.
DOI : 10.1016/j.ic.2007.01.003
URL : http://doi.org/10.1016/j.ic.2007.01.003

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.44-599, 1998.
DOI : 10.1109/18.661507

T. Laihonen, Optimal t-Edge-Robust r-Identifying Codes in the King Lattice, Graphs and Combinatorics, vol.22, issue.4, pp.487-496, 2006.
DOI : 10.1007/s00373-006-0682-z

T. Laihonen, On edge-robust (1, ? ?)-identifying codes in binary Hamming spaces, International Journal of Pure and Applied Mathematics, vol.36, pp.87-102, 2007.

A. , L. D. Roberts, and F. S. Roberts, Locating sensors in paths and cycles: The case of 2-identifying codes, European Journal of Combinatorics, vol.29, issue.1, pp.72-82, 2008.
DOI : 10.1016/j.ejc.2006.12.006