1. Complexity results for identifying codes in planar graphs;Auger;International Transactions in Operational Research,2010
2. D. Auger, I. Charon, O. Hudry, A. Lobstein, Maximum size of a minimum watching system and the graphs achieving the bound, Rapport Interne Telecom ParisTech-2010D011, Paris, France, March 2010, p. 40.
3. Complexité Algorithmique et Problèmes de Communications;Barthélemy,1992
4. Graphes;Berge,1983
5. Identifying and locating-dominating codes on chains and cycles;Bertrand;European Journal of Combinatorics,2004