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