Multiple list colouring triangle-free planar graphs
Yiting Jiang, Xuding Zhu·2018-09-11·via math.CO updates on arXiv.org
This paper proves that for each positive integer $m$, there is a triangle-free planar graph $G$ which is not $(3m+ \lceil \frac m{17} \rceil-1, m)$-choosable.