Q5135780 (Q5135780): Difference between revisions

@@ Property / cites work @@
+Minimal identifying codes in trees and planar graphs with large girth
+Normal rank
@@ Property / cites work @@
+Watching systems in graphs: an extension of identifying codes
+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 @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Extremal graphs for the identifying code problem
@@ Property / cites work: Extremal graphs for the identifying code problem / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying Codes in Line Graphs
@@ Property / cites work: Identifying Codes in Line Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of identifying codes in triangle-free graphs
+Normal rank