Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092): Difference between revisions

@@ Property / cites work @@
+Another algebraic proof of Bondy's theorem on induced subsets
+Normal rank
@@ Property / cites work @@
+Q3726125
@@ Property / cites work: Q3726125 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subsets
@@ Property / cites work: Induced subsets / rank @@
+Normal rank
@@ Property / cites work @@
+Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
+Normal rank
@@ Property / cites work @@
+A linear algorithm for minimum 1-identifying codes in oriented trees
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes: NP-completeness results for directed graphs
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes 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 @@
+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 @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684148
@@ Property / cites work: Q3684148 / rank @@
+Normal rank