The Alon-Tarsi number of planar graphs
classification
🧮 math.CO
keywords
planaralon-tarsigraphsnumberalternatechoosabilitygivesgraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.