On locating--dominating sets in infinite grids (Q819007): Difference between revisions

@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+Normal rank
@@ Property / cites work @@
+Q4871138
@@ Property / cites work: Q4871138 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes: NP-completeness results for directed graphs
+Normal rank
@@ Property / cites work @@
+Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+Normal rank
@@ Property / cites work @@
+Q3789614
@@ Property / cites work: Q3789614 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3828043
@@ Property / cites work: Q3828043 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal locating-dominating set in the infinite triangular grid
+Normal rank
@@ Property / cites work @@
+On robust and dynamic identifying codes
@@ Property / cites work: On robust and dynamic identifying codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4667607
@@ Property / cites work: Q4667607 / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Q3684148
@@ Property / cites work: Q3684148 / rank @@
+Normal rank
@@ Property / cites work @@
+Domination and location in acyclic graphs
@@ Property / cites work: Domination and location in acyclic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3803159
@@ Property / cites work: Q3803159 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871068
@@ Property / cites work: Q4871068 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-tolerant locating-dominating sets
@@ Property / cites work: Fault-tolerant locating-dominating sets / rank @@
+Normal rank