On locating--dominating sets in infinite grids
type: Item
instance of: scholarly article
title: On locating--dominating sets in infinite grids
zbMATH Open document ID: 1082.05069
author: Tero Laihonen
author: Iiro Honkala
published in: European Journal of Combinatorics
publication date: 2006-03-22T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5014212
MaRDI profile type: Publication
full work available at URL: j.ejc.2004.09.002
OpenAlex ID: W2063757303
cites work: Identifying and locating-dominating codes on chains and cycles
cites work: Q4871138
cites work: Identifying and locating-dominating codes: NP-completeness results for directed graphs
cites work: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
cites work: Extremal cardinalities for identifying and locating-dominating codes in graphs
cites work: Q3789614
cites work: Q3828043
cites work: Q4368728
cites work: An optimal locating-dominating set in the infinite triangular grid
cites work: On robust and dynamic identifying codes
cites work: Q4667607
cites work: On a new class of codes for identifying vertices in graphs
cites work: Q3684148
cites work: Domination and location in acyclic graphs
cites work: Q3803159
cites work: Q4871068
cites work: Fault-tolerant locating-dominating sets
DOI: 10.1016/J.EJC.2004.09.002
description: scientific article; zbMATH DE number 5014212