On the size of identifying codes in triangle-free graphs

Florent Foucaud, Ralf Klasing, Adrian Kosowski +1

In an undirected graph $G$, a subset $C\subseteq V(G)$ such that $C$ is a dominating set of $G$, and each vertex in $V(G)$ is dominated by a distinct subset of vertices from $C$, i…