2-distance choice number of planar graphs with maximal degree no more than 4

DOI10.1142/S1793830921500518zbMath1478.05062OpenAlexW3095527475MaRDI QIDQ5025121

Wenjuan Zhou, Lei Sun

Publication date: 1 February 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500518

zbMATH Keywords

girthplanar graphmaximum degree2-distance \(k\)-choosable graph

Mathematics Subject Classification ID

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

Cites Work

• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• Minimum 2-distance coloring of planar graphs and channel assignment
• List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• A bound on the chromatic number of the square of a planar graph
• List Colouring Squares of Planar Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-distance choice number of planar graphs with maximal degree no more than 4