\(2\)-distance coloring of planar graphs with maximum degree \(5\)

DOI10.1016/j.disc.2021.112766zbMath1483.05059OpenAlexW4205307969MaRDI QIDQ2075520

Shan Zhou, Ming Chen, Lian-Ying Miao

Publication date: 14 February 2022

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

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112766

zbMATH Keywords

planar graphdischarging\(2\)-distance \(k\)-coloring

Mathematics Subject Classification ID

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

Related Items (3)

2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree

Cites Work

• Minimum 2-distance coloring of planar graphs and channel assignment
• 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

This page was built for publication: \(2\)-distance coloring of planar graphs with maximum degree \(5\)