You are here: TUCS > PUBLICATIONS > Publication Search > General bounds for identifying...
General bounds for identifying codes in some infinite regular graphs
Irène Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein, General bounds for identifying codes in some infinite regular graphs. Electronic Journal of Combinatorics , R39, 2001.
BibTeX entry:
@ARTICLE{jChHoHuLoa,
title = {General bounds for identifying codes in some infinite regular graphs},
author = {Charon, Irène and Honkala, Iiro and Hudry, Olivier and Lobstein, Antoine},
journal = {Electronic Journal of Combinatorics},
pages = {R39},
year = {2001},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics
Publication Forum rating of this publication: level 2