Minimum sizes of identifying codes in graphs differing by one vertex

Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein. Minimum sizes of identifying codes in graphs differing by one vertex. Cryptography and Communications, 5(2):119-136, 2013. [doi]

@article{CharonHHL13,
  title = {Minimum sizes of identifying codes in graphs differing by one vertex},
  author = {Irène Charon and Iiro S. Honkala and Olivier Hudry and Antoine Lobstein},
  year = {2013},
  doi = {10.1007/s12095-012-0078-2},
  url = {http://dx.doi.org/10.1007/s12095-012-0078-2},
  researchr = {https://researchr.org/publication/CharonHHL13},
  cites = {0},
  citedby = {0},
  journal = {Cryptography and Communications},
  volume = {5},
  number = {2},
  pages = {119-136},
}