The Alon–Tarsi number of planar graphs revisited
From MaRDI portal
Publication:6144916
DOI10.1002/jgt.23047arXiv2203.16308OpenAlexW4387602711MaRDI QIDQ6144916
Publication date: 30 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.16308
Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- On two generalizations of the Alon-Tarsi polynomial method
- Planar graphs are 1-relaxed, 4-choosable
- Colorings and orientations of graphs
- Every planar graph is 5-choosable
- The Alon-Tarsi number of planar graphs
- The Alon-Tarsi number of a planar graph minus a matching
- Mr. Paint and Mrs. Correct
- Combinatorial Nullstellensatz
This page was built for publication: The Alon–Tarsi number of planar graphs revisited