The Alon-Tarsi number of a planar graph minus a matching

DOI10.1016/j.jctb.2020.02.005zbMath1448.05050arXiv1811.12012OpenAlexW3009314871WikidataQ112881845 ScholiaQ112881845MaRDI QIDQ2200936

Jarosław Grytczuk, Xuding Zhu

Publication date: 24 September 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

planar graphlist colouringon-line list colouringAlon-Tarsi number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Graph polynomials and group coloring of graphs ⋮ Graph polynomials and paintability of plane graphs ⋮ Every planar graph is 1-defective \((9,2)\)-paintable ⋮ Decomposing planar graphs into graphs with degree restrictions ⋮ A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles ⋮ The Alon–Tarsi number of planar graphs revisited ⋮ On the Alon-Tarsi number of semi-strong product of graphs ⋮ Schnyder woods and Alon-Tarsi number of planar graphs ⋮ Weak (2, 3)-decomposition of planar graphs ⋮ Decomposition of planar graphs with forbidden configurations ⋮ The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) ⋮ The Alon-Tarsi number of \(K_5\)-minor-free graphs ⋮ The polynomial method for list-colouring extendability of outerplanar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two generalizations of the Alon-Tarsi polynomial method
• List colourings of planar graphs
• 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
• Defective 3-paintability of planar graphs
• A refinement of choosability of graphs
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• On \(t\)-common list-colorings
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Combinatorial Nullstellensatz
• List Improper Colourings of Planar Graphs
• Locally planar graphs are 2-defective 4-paintable

This page was built for publication: The Alon-Tarsi number of a planar graph minus a matching