Systèmes de contrôle dans les graphes : une extension des codes identifiants, Rapport Interne Télécom ParisTech-2010D011, pp.40-2010 ,
Watching systems in graphs: An extension of identifying codes, Discrete Applied Mathematics, vol.161, issue.12 ,
DOI : 10.1016/j.dam.2011.04.025
URL : https://hal.archives-ouvertes.fr/hal-00481469
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
Classifying graphs with minimum identifying code of size n?1, Abstracts of the 8th French Combinatorial Conference, 2010. ,
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
On graphs having a V \ {x} set as an identifying code, Discrete Math, pp.432-434, 2007. ,
On identification in Z 2 using translates of given patterns, J. Universal Comput. Sci, vol.9, issue.10, pp.1204-1219, 2003. ,
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 Handbook of Integer Sequences, 1973. ,
The On-Line Encyclopedia of Integer Sequences, https://oeis, p.55 ,