Krivelevich, M. “Sparse Graphs Usually Have Exponentially Many Optimal Colorings”. The Electronic Journal of Combinatorics, Vol. 9, no. 1, June 2002, p. R27, doi:10.37236/1643.