List 2-distance coloring of planar graphs with girth five

DOI10.1007/s10255-022-1097-1zbMath1492.05045OpenAlexW4283743365MaRDI QIDQ2155644

Yin-dong Jin, Lian-Ying Miao

Publication date: 15 July 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1097-1

zbMATH Keywords

girthmaximum degree2-distance coloringlist 2-distance coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

2-distance coloring of planar graphs without adjacent 5-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved bound on 2-distance coloring plane graphs with girth 5
• List coloring the square of sparse graphs with large degree
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• An optimal square coloring of planar graphs
• Coloring squares of planar graphs with girth six
• A bound on the chromatic number of the square of a planar graph
• Labeling Planar Graphs with Conditions on Girth and Distance Two

This page was built for publication: List 2-distance coloring of planar graphs with girth five