The Alon-Tarsi number of planar graphs
arXiv:1711.10817
Abstract
This paper proves that the Alon-Tarsi number of any planar graph is at most , which gives an alternate proof of the -choosability as well as the -paintability of planar graphs.
0 figures, 7 pages