Choosability with union separation of triangle-free planar graphs

DOI10.1016/j.disc.2020.112137zbMath1454.05031OpenAlexW3086962308MaRDI QIDQ2005734

Hongguo Zhu, Jian-Feng Hou

Publication date: 8 October 2020

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

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112137

zbMATH Keywords

triangledischargeplanar graphchoosability

Mathematics Subject Classification ID

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

Related Items (5)

Choosability with union separation of planar graphs without cycles of length 4 ⋮ List 4-colouring of planar graphs ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ On \(L (p, q)\)-labelling of planar graphs without cycles of length four ⋮ On \((3, r)\)-choosability of some planar graphs

Cites Work

• Unnamed Item
• List colourings of planar graphs
• On choosability with separation of planar graphs without adjacent short cycles
• Every planar map is four colorable. I: Discharging
• Every planar graph is 5-choosable
• Choosability with union separation
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Colorings of plane graphs: a survey
• Brooks-type theorems for choosability with separation

This page was built for publication: Choosability with union separation of triangle-free planar graphs