The Alon-Tarsi number of planar graphs
From MaRDI portal
Publication:1633764
DOI10.1016/j.jctb.2018.06.004zbMath1402.05051arXiv1711.10817OpenAlexW2963961768MaRDI QIDQ1633764
Publication date: 20 December 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.10817
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (16)
Graph polynomials and group coloring of graphs ⋮ Graph polynomials and paintability of plane graphs ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ Weak degeneracy of planar graphs and locally planar graphs ⋮ The Alon–Tarsi number of planar graphs revisited ⋮ The Alon-Tarsi number of two kinds of planar graphs ⋮ Decomposition of toroidal graphs without some subgraphs ⋮ On the Alon-Tarsi number of semi-strong product of graphs ⋮ Schnyder woods and Alon-Tarsi number of planar graphs ⋮ A strengthening and an efficient implementation of Alon-Tarsi list coloring method ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ The Alon-Tarsi number of \(K_5\)-minor-free graphs ⋮ Alon-Tarsi number and modulo Alon-Tarsi number of signed graphs ⋮ The polynomial method for list-colouring extendability of outerplanar graphs
Cites Work
- Unnamed Item
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- On two generalizations of the Alon-Tarsi polynomial method
- Colorings and orientations of graphs
- Every planar graph is 5-choosable
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
This page was built for publication: The Alon-Tarsi number of planar graphs
