2-distance choosability of planar graphs with a restriction for maximum degree

DOI10.1016/j.amc.2023.127949OpenAlexW4323256318MaRDI QIDQ2698256

Jiahao Yu, Min Chen, Wei Fan Wang

Publication date: 21 April 2023

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

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

zbMATH Keywords

planar graphmaximum degree2-distance coloring2-distance choosability

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved bound on 2-distance coloring plane graphs with girth 5
• 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
• Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• 2-distance coloring of planar graphs with girth 5
• The square of a planar cubic graph is 7-colorable
• \(2\)-distance coloring of planar graphs with maximum degree \(5\)
• A bound on the chromatic number of the square of a planar graph
• Labelling Graphs with a Condition at Distance 2
• Coloring Powers of Planar Graphs
• Coloring the square of a planar graph
• Choosability conjectures and multicircuits

This page was built for publication: 2-distance choosability of planar graphs with a restriction for maximum degree