\((4,2)\)-choosability of planar graphs with forbidden structures

DOI10.1007/s00373-017-1812-5zbMath1371.05072arXiv1512.03787OpenAlexW2190906998MaRDI QIDQ2409516

Bernard Lidický, Kirsten Hogenson, Derrick Stolee, Kevin Moss, Zhanar Berikkyzy, Mohit Kumbhat, Christopher Cox, Kathleen Nowak, Kevin F. Palmowski, Kacy Messerschmidt, Michael Dairyko

Publication date: 11 October 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringplanar graphdischargingchoosability with separation

Mathematics Subject Classification ID

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

Related Items (3)

Choosability with union separation ⋮ List 4-colouring of planar graphs ⋮ On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\)

Cites Work

• Unnamed Item
• An introduction to the discharging method via graph coloring
• List colourings of planar graphs
• Planar graphs without cycles of specific lengths
• Colorings and orientations of graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Choosability and edge choosability of planar graphs without five cycles
• Colorings of plane graphs: a survey
• On choosability with separation of planar graphs with lists of different sizes
• Planar graphs without triangular 4-cycles are 3-choosable
• On Choosability with Separation of Planar Graphs with Forbidden Cycles
• Planar Graphs without 7-Cycles Are 4-Choosable
• Brooks-type theorems for choosability with separation

This page was built for publication: \((4,2)\)-choosability of planar graphs with forbidden structures