Choosability with union separation of planar graphs without cycles of length 4

DOI10.1016/j.amc.2020.125477zbMath1497.05085OpenAlexW3039574461MaRDI QIDQ2656689

Hongguo Zhu, Jian-Feng Hou

Publication date: 16 March 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2020.125477

zbMATH Keywords

dischargeplanar graphchoosability\(C_4\)-free graph

Mathematics Subject Classification ID

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

Related Items (1)

On \(( 2 , r )\)-choosability of planar graphs without short cycles

Cites Work

• Steinberg's conjecture is false
• Acyclic 4-choosability of planar graphs
• List colourings of planar graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• A sufficient condition for planar graphs to be (3,1)-choosable
• Choosability with union separation
• Strong list-chromatic index of subcubic graphs
• Colorings of plane graphs: a survey
• Choosability with union separation of triangle-free planar graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• On Choosability with Separation of Planar Graphs with Forbidden Cycles
• Brooks-type theorems for choosability with separation
• Unnamed Item
• Unnamed Item

This page was built for publication: Choosability with union separation of planar graphs without cycles of length 4