Journal of Combinatorial Theory, Series BVolume 134, January 2019, Pages 354-358NotesThe Alon–Tarsi number of planar graphsAuthor links open overlay panelXuding Zhu 1Show moreShareCitehttps://doi.org/10.1016/j.jctb.2018.06.004Get rights and contentUnder an Elsevier user licenseopen archiveAbstractThis 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.Previous article in issueNext article in issueKeywordsPlanar graphList colouringOn-line list colouringAlon–Tarsi numberRecommended articlesCited by (0)1Grant Number: NSFC 11571319.© 2018 Elsevier Inc.