[1]
Charon, I., Honkala, I., Hudry, O. and Lobstein, A. 2001. General Bounds for Identifying Codes in Some Infinite Regular Graphs. The Electronic Journal of Combinatorics. 8, 1 (Nov. 2001), R39. DOI:https://doi.org/10.37236/1583.