1.
Rabern L. A Better Lower Bound on Average Degree of Online $k$-List-Critical Graphs. Electron. J. Combin. [Internet]. 2018Mar.2 [cited 2026Mar.29];25(1):P1.51. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p51