The Alon-Tarsi number of planar graphs

摘要

This paper proves that the Alon-Tarsi number of any planar graph is at most 5, which solves an open problem posed in Hefetz (2011) [2] and gives an alternate proof of the 5-choosability as well as the 5-paintability of planar graphs. (C) 2018 Elsevier Inc. All rights reserved.