Krivelevich M. Sparse Graphs Usually Have Exponentially Many Optimal Colorings. Electron. J. Combin. [Internet]. 2002Jun.8 [cited 2026Mar.15];9(1):R27. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v9i1r27