-
On the size of identifying codes in triangle-free graphs
International audience -
Combinatorial and algorithmic aspects of identifying codes in graphs
We study combinatorial and algorithmic aspects of identifying codes in graphs. An identifying code is a set of vertices of a graph such that, on the one hand, each...
