Krivelevich, M. (2002). Sparse Graphs Usually Have Exponentially Many Optimal Colorings. The Electronic Journal of Combinatorics, 9(1), R27. https://doi.org/10.37236/1643