New bounds for codes identifying vertices in graphs.
Cohen, Gérard, Honkala, Iiro, Lobstein, Antoine, Zémor, Gilles (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Adaptive identification in Torii in the King lattice.”
New bounds for codes identifying vertices in graphs.
Construction of codes identifying sets of vertices.
Gravier, Sylvain, Moncel, Julien (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Identifying codes of Cartesian product of two cliques of the same size.
Gravier, S., Moncel, J., Semri, A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
General bounds for identifying codes in some infinite regular graphs.
Charon, Irène, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An optimal strongly identifying code in the infinite triangular grid.
Honkala, Iiro (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Structural properties of twin-free graphs.
Charon, Iréne, Honkala, Iiro, Hudry, Olivier, Lobstein, Antoine (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Induced trees in triangle-free graphs.
Matousek, Jirí, Sámal, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On identifying codes in the King grid that are robust against edge deletions.
Honkala, Iiro, Laihonen, Tero (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs associated with codes of covering radius 1 and minimum distance 2.
Hall, Joanne L. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
1-perfect codes over self-complementary graphs
Jan Kratochvíl (1985)
Commentationes Mathematicae Universitatis Carolinae
Similarity: