Krivelevich, Michael. “Sparse Graphs Usually Have Exponentially Many Optimal Colorings”. The Electronic Journal of Combinatorics 9, no. 1 (June 8, 2002): R27. Accessed March 15, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v9i1r27.