Multiple list colouring triangle-free planar graphs

Abstract

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.

6 pages, 1 figure

References in corpus (1)

• A $4$-choosable graph that is not $(8:2)$-choosable