On the size of identifying codes in triangle-free graphs (Q427898): Difference between revisions

@@ Property / author @@
-Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
-Normal rank
@@ Property / author @@
+Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2143470177
@@ Property / OpenAlex ID: W2143470177 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5975
@@ Property / arXiv ID: 1010.5975 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal identifying codes in trees and planar graphs with large girth
+Normal rank
@@ Property / cites work @@
+Complexity results for identifying codes in planar graphs
+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 @@
+Parity Graphs
@@ Property / cites work: Parity Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for minimum 1-identifying codes in oriented trees
+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 @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+Normal rank
@@ Property / cites work @@
+Q3789614
@@ Property / cites work: Q3789614 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+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 @@
+Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
+Normal rank
@@ Property / cites work @@
+Bounds for identifying codes in terms of degree parameters
+Normal rank
@@ Property / cites work @@
+On graphs having a \(V\setminus \{x\}\) set as an identifying code
+Normal rank
@@ Property / cites work @@
+Identifying codes of cycles
@@ Property / cites work: Identifying codes of cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q5837979
@@ Property / cites work: Q5837979 / rank @@
+Normal rank
@@ Property / cites work @@
+Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs
+Normal rank
@@ Property / cites work @@
+On the size of identifying codes in binary hypercubes
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Lower bound of the Hadwiger number of graphs by their average degree
+Normal rank
@@ Property / cites work @@
+On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)
+Normal rank
@@ Property / cites work @@
+Two families of optimal identifying codes in binary Hamming spaces
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Domination and location in acyclic graphs
@@ Property / cites work: Domination and location in acyclic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684148
@@ Property / cites work: Q3684148 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:427898