On weak flexibility in planar graphs

DOI10.1007/s00373-022-02564-1zbMath1502.05042arXiv2009.07932OpenAlexW3086607644MaRDI QIDQ2093108

Kyle Murphy, Bernard Lidický, Tomáš Masařík, Shira Zerbib

Publication date: 4 November 2022

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

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

zbMATH Keywords

flexibilitylist coloringdischarging

Mathematics Subject Classification ID

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

Cites Work

• An introduction to the discharging method via graph coloring
• Planar graphs without cycles of specific lengths
• The 4-choosability of plane graphs without 4-cycles
• Choosability and edge choosability of planar graphs without five cycles
• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• Flexibility of planar graphs of girth at least six
• List coloring with requests
• Flexible list colorings in graphs with special degeneracy conditions

This page was built for publication: On weak flexibility in planar graphs