KRIVELEVICH, M. Sparse Graphs Usually Have Exponentially Many Optimal Colorings. The Electronic Journal of Combinatorics, v. 9, n. 1, p. R27, 8 Jun. 2002.