A disproof of a gap-one conjecture for the equitable chromatic number of block graphs
For a graph $G$, let $L(G)=\max\{ω(G),\lceil (|V(G)|+1)/(α_{\min}(G)+1)\rceil\}$, where $ω(G)$ is the clique number and $α_{\min}(G)$ is the minimum, over all vertices $v$, of the largest size of an independent set containing $v$. Dybizbański, Furmańczyk, and Mkrtchyan (Discrete Appl. Math. 354 (2024), 15--28) conjectured that every...