Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Auger, D., Charon, I., Hudry, O., Lobstein, A.: Maximum size of a minimum watching system and the graphs achieving the bound (submitted)
2. Auger, D., Charon, I., Hudry, O., Lobstein, A.: Watching systems in graphs: an extension of identifying codes. Discret. Appl. Math. (2011) (in press)
3. Charon, I., Hudry, O., Lobstein, A.: Identifying codes with small radius in some infinite regular graphs. Electron. J. Comb. 9(1) (2002)
4. Cohen G.D., Honkala I., Lobstein A., Zémor G.: Bounds for codes identifying vertices in the hexagonal grid. SIAM J. Discret. Math 13, 492 (2000)
5. Cohen G.D., Honkala L., Lobstein A., Zémor G.: On codes identifying vertices in the two-dimensional square lattice with diagonals. IEEE Trans. Comput. 50(2), 174–176 (2001)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献