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