Graph polynomials and paintability of plane graphs

DOI10.1016/j.dam.2022.02.006zbMath1485.05081OpenAlexW3014953398MaRDI QIDQ833000

Mariusz Zając, Jarosław Grytczuk, Stanlislav Jendroľ

Publication date: 28 March 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.02.006

zbMATH Keywords

choosabilitygraph polynomialspaintabilityAlon-Tarsi number

Mathematics Subject Classification ID

Graph polynomials (05C31) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Graph polynomials and group coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Brooks' theorem via the Alon-Tarsi theorem
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• The Alon-Tarsi number of planar graphs
• Colorings of plane graphs: a survey
• The Alon-Tarsi number of a planar graph minus a matching
• Note on 3-choosability of planar graphs with maximum degree 4
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• Ein Sechsfarbenproblem auf der Kugel
• Facially-constrained colorings of plane graphs: a survey
• List edge colourings of some 1-factorable multigraphs
• Facial list colourings of plane graphs
• Combinatorial Nullstellensatz
• Coupled choosability of plane graphs

This page was built for publication: Graph polynomials and paintability of plane graphs