Rabern, L. “A Better Lower Bound on Average Degree of Online $k$-List-Critical Graphs”. The Electronic Journal of Combinatorics, Vol. 25, no. 1, Mar. 2018, p. P1.51, doi:10.37236/6405.