Flexibility of planar graphs -- sharpening the tools to get lists of size four

DOI10.1016/j.dam.2021.09.021zbMath1477.05053arXiv2004.10917OpenAlexW3209684967MaRDI QIDQ2243143

Fuhong Ma, Michael Ferrara, Felix Christian Clemen, Tomáš Masařík, Ilkyoo Choi, Paul S. Horn

Publication date: 11 November 2021

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

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

zbMATH Keywords

graph coloringplanar graphsflexibilitychoosability

Mathematics Subject Classification ID

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

Related Items (3)

Flexible list colorings in graphs with special degeneracy conditions ⋮ On weak flexibility in planar graphs ⋮ On sufficient conditions for planar graphs to be 5-flexible

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• An introduction to the discharging method via graph coloring
• List precoloring extension in planar graphs
• Extending precolourings of circular cliques
• List colourings of planar graphs
• A non-3-choosable planar graph without cycles of length 4 and 5
• Precoloring extension. I: Interval graphs
• You can't paint yourself into a corner
• 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
• Extending precolorings to distinguish group actions
• Smaller planar triangle-free graphs that are not 3-list-colorable
• Extending precolorings of subgraphs of locally planar graphs
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Extending precolorings to circular colorings
• Precoloring extension forK₄-minor-free graphs
• Graph colorings with local constraints -- a survey
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Precoloring Extension III: Classes of Perfect Graphs
• Flexibility of planar graphs of girth at least six
• List coloring with requests
• Precoloring Extensions of Brooks' Theorem
• Flexibility of triangle‐free planar graphs

This page was built for publication: Flexibility of planar graphs -- sharpening the tools to get lists of size four