Rabern, Landon. “A Better Lower Bound on Average Degree of Online $k$-List-Critical Graphs”. The Electronic Journal of Combinatorics 25, no. 1 (March 2, 2018): P1.51. Accessed March 29, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p51.