-
Locally identifying colourings for graphs with given maximum degree
International audience -
On the size of identifying codes in triangle-free graphs
International audience -
Bounds for identifying codes in terms of degree parameters
International audience -
Reed's conjecture on some special classes of graphs
Submitted to Discrete Mathematics -
Reed's Conjecture on hole expansions
In 1998, Reed conjectured that for any graph $G$, $\chi(G) \leq \lceil \frac{\omega(G) + \Delta(G)+1}{2}\rceil$, where $\chi(G)$, $\omega(G)$, and $\Delta(G)$...
