The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)

DOI10.1016/j.disc.2019.111797zbMath1435.05061arXiv1910.12598OpenAlexW2999580227WikidataQ112880938 ScholiaQ112880938MaRDI QIDQ2305911

Hua Jing Lu, Xuding Zhu

Publication date: 20 March 2020

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

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

zbMATH Keywords

planar graphchoice numberpaint numberAlon-Tarsi number

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (8)

A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles ⋮ Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Decomposition of toroidal graphs without some subgraphs ⋮ On the Alon-Tarsi number of semi-strong product of graphs ⋮ A weak DP-coloring of planar graphs without 4- and 9-cycles ⋮ Decomposition of planar graphs with forbidden configurations ⋮ Relaxed DP-3-coloring of planar graphs without some cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Chip games and paintability
• Planar graphs are 1-relaxed, 4-choosable
• Colorings and orientations of graphs
• Defective 3-paintability of planar graphs
• The Alon-Tarsi number of a planar graph minus a matching
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• List Improper Colourings of Planar Graphs
• A note on list improper coloring planar graphs

This page was built for publication: The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)