Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600): Difference between revisions

@@ Property / author @@
-Camino Balbuena
@@ Property / author: Camino Balbuena / rank @@
-Normal rank
@@ Property / author @@
+Camino Balbuena
@@ Property / author: Camino Balbuena / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2949252613
@@ Property / OpenAlex ID: W2949252613 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04913
@@ Property / arXiv ID: 1902.04913 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial linear spaces and identifying codes
@@ Property / cites work: Partial linear spaces and identifying codes / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing identifying codes from the spectrum of a graph or digraph
+Normal rank
@@ Property / cites work @@
+Locating-dominating sets and identifying codes in graphs of girth at least 5
+Normal rank
@@ Property / cites work @@
+Q4539516
@@ Property / cites work: Q4539516 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+Normal rank
@@ Property / cites work @@
+New identifying codes in the binary Hamming space
@@ Property / cites work: New identifying codes in the binary Hamming space / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes: NP-completeness results for directed graphs
+Normal rank
@@ Property / cites work @@
+A linear algorithm for minimum 1-identifying codes in oriented trees
+Normal rank
@@ Property / cites work @@
+Upper bounds for binary identifying codes
@@ Property / cites work: Upper bounds for binary identifying codes / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds on identifying codes in binary Hamming spaces
+Normal rank
@@ Property / cites work @@
+Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
+Normal rank
@@ Property / cites work @@
+Codes identifying sets of vertices in random networks
+Normal rank
@@ Property / cites work @@
+Construction of codes identifying sets of vertices
+Normal rank
@@ Property / cites work @@
+Identifying codes in vertex-transitive graphs and strongly regular graphs
+Normal rank
@@ Property / cites work @@
+On identifying codes in the King grid that are robust against edge deletions
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+On cages admitting identifying codes
@@ Property / cites work: On cages admitting identifying codes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474243
@@ Property / cites work: Q4474243 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2042600