On the number of optimal identifying codes in a twin-free graph (Q476309): Difference between revisions

@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+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 @@
+Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial bounds via measure and conquer
@@ Property / cites work: Combinatorial bounds via measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying codes of Cartesian product of two cliques of the same size
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Total Domination in Graphs
@@ Property / cites work: Total Domination in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the ensemble of optimal dominating and locating-dominating codes in a graph
+Normal rank
@@ Property / cites work @@
+On the ensemble of optimal identifying codes in a twin-free graph
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
+Normal rank