Extremal graphs for the identifying code problem (Q2430979): Difference between revisions

@@ Property / cites work @@
+Induced subsets
@@ Property / cites work: Induced subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+Normal rank
@@ Property / cites work @@
+Q4659582
@@ Property / cites work: Q4659582 / rank @@
+Normal rank
@@ Property / cites work @@
+Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
+Normal rank
@@ Property / cites work @@
+Structural properties of twin-free graphs
@@ Property / cites work: Structural properties of twin-free graphs / rank @@
+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 @@
+Q2717197
@@ Property / cites work: Q2717197 / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs having a \(V\setminus \{x\}\) set as an identifying code
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Computing roots of graphs is hard
@@ Property / cites work: Computing roots of graphs is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q3803159
@@ Property / cites work: Q3803159 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684148
@@ Property / cites work: Q3684148 / rank @@
+Normal rank