Weak degeneracy of planar graphs and locally planar graphs

DOI10.37236/11749arXiv2303.07901OpenAlexW4388289270MaRDI QIDQ6117236

Tao Wang, Xuding Zhu, Ming Han, Huan Zhou, Jianglin Wu

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Locally planar graphs are 5-choosable
• Five-coloring maps on surfaces
• The Alon-Tarsi number of planar graphs
• 3-list-coloring planar graphs of girth 5
• On-line DP-coloring of graphs
• Locally planar graphs are 5-paintable
• 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
• Weak degeneracy of graphs

This page was built for publication: Weak degeneracy of planar graphs and locally planar graphs