List colouring triangle free planar graphs

Abstract

This paper proves the following result: Assume $G$ is a triangle free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\mid L(v)\mid =4$ for each vertex $v\in V(G)-X$ and $\mid L(v)\mid =3$ for each vertex $v\in X$, then $G$ is $L$-colourable.

19 pages, 0 figures

References in corpus (1)

• The Alon-Tarsi number of a planar graph minus a matching