Identifying codes and watching systems in Kneser graphs (Q2966507): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ 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 @@
+Q4342632
@@ Property / cites work: Q4342632 / 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 @@
+Extremal graphs for the identifying code problem
@@ Property / cites work: Extremal graphs for the identifying code problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of identifying codes in triangle-free graphs
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Q5135780
@@ Property / cites work: Q5135780 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s1793830917500070
+Normal rank
@@ Property / OpenAlex ID @@
+W2556224564
@@ Property / OpenAlex ID: W2556224564 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2966507