Rabern, Landon. 2018. “A Better Lower Bound on Average Degree of Online $k$-List-Critical Graphs”. The Electronic Journal of Combinatorics 25 (1), P1.51. https://doi.org/10.37236/6405.