Identifying codes with small radius in some infinite regular graphs.
Charon, Irène, Hudry, Olivier, Lobstein, Antoine (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Charon, Irène, Hudry, Olivier, Lobstein, Antoine (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cohen, Gérard, Honkala, Iiro, Lobstein, Antoine, Zémor, Gilles (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gravier, Sylvain, Moncel, Julien (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gravier, S., Moncel, J., Semri, A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Honkala, Iiro, Laihonen, Tero (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ben-Haim, Yael, Gravier, Sylvain, Lobstein, Antoine, Moncel, Julien (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Honkala, Iiro (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Michał Kolarz (2010)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We consider directed figures defined as labelled polyominoes with designated start and end points, with two types of catenation operations. We are especially interested in codicity verification for sets of figures, and we show that depending on the catenation type the question whether a given set of directed figures is a code is decidable or not. In the former case we give a constructive proof which leads to a straightforward algorithm.
Hall, Joanne L. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Carlos Araujo, Italo Dejter (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G, Φ) formed by abelian groups G and homomorphisms Φ: Zn → G. A conjecture is posed that the cited contribution covers all possible cases. A related conjecture on the unfinished work on open problems on lattice-like perfect dominating sets in Λn with induced components that are parallel paths of length > 1 is posed as well.
King, Oliver D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cohn, Henry, Kumar, Abhinav (2007)
The New York Journal of Mathematics [electronic only]
Similarity: