Schnyder woods and Alon-Tarsi number of planar graphs

DOI10.37236/11888arXiv2303.02683MaRDI QIDQ6194260

Bartosz Podkanowicz, Jakub Kozik

Publication date: 19 March 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.02683

zbMATH Keywords

choosability of a planar graphdecompositions of planar graphs into trees

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
• List colourings of planar graphs
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• The Alon-Tarsi number of planar graphs
• Signed planar graphs with given circular chromatic numbers
• The Alon-Tarsi number of a planar graph minus a matching
• On topological aspects of orientations

This page was built for publication: Schnyder woods and Alon-Tarsi number of planar graphs