J Fox,
X He, F Manners - Journal of Combinatorial Theory, Series B, 2019 - Elsevier
In 1971, Tomescu conjectured that every connected graph G on n vertices with chromatic
number k≥ 4 has at most k!(k− 1) n− k proper k-colorings. Recently, Knox and Mohar proved …