(1)
Krivelevich, M. Sparse Graphs Usually Have Exponentially Many Optimal Colorings. Electron. J. Combin. 2002, 9, R27.