The Alon-Tarsi number of planar graphs

2017/11/29 by Xuding Zhu, Zhu, Xuding · 1 citation
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Optimization and Search Problems

paper · pdf · doi:10.48550/arxiv.1711.10817

openalex publication_date 2017/11/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper proves that the Alon-Tarsi number of any planar graph is at most 5, which gives an alternate proof of the 5-choosability as well as the 5-paintability of planar graphs.

Cited by

• On Alon-Tarsi orientations of sparse graphs

Related

• The Alon-Tarsi number of planar graphs -- a simple proof
• The Alon-Tarsi number of a planar graph minus a matching
• Alon-Tarsi number of signed planar graphs
• The Alon-Tarsi number of subgraphs of a planar graph
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and l