Density of identifying codes of hexagonal grids with finite number of rows

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Bounds on codes (94B65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

Optimal lower bound for 2-identifying codes in the hexagonal grid
An introduction to the discharging method via graph coloring
Identifying codes for infinite triangular grids with a finite number of rows
Identifying codes in some subgraphs of the square lattice
On identifying codes in the hexagonal mesh
A characterization of the minimum cycle mean in a digraph
The minimum density of an identifying code in the king lattice.
Codes for identification in the king lattice
Fault-tolerant locating-dominating sets
Periodicity of identifying codes in strips
On identification in the triangular grid
On the density of identifying codes in the square lattice
On the identification of sets of points in the square lattice
Lower bounds for identifying codes in some infinite grids
A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
New bounds on the minimum density of an identifying code for the infinite hexagonal grid
Bounds for codes identifying vertices in the hexagonal grid
On identifying codes
Minimum-Density Identifying Codes in Square Grids
Finding minimum cost to time ratio cycles with small integral transit times
On a new class of codes for identifying vertices in graphs
On Identifying Codes in the Triangular and Square Grids
Exact Minimum Density of Codes Identifying Vertices in the Square Grid
Minimum density of identifying codes of king grids
General bounds for identifying codes in some infinite regular graphs
Identifying codes with small radius in some infinite regular graphs