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

DOI10.1007/s10878-023-01053-2OpenAlexW4381336048MaRDI QIDQ6166190

Hongguo Zhu, Yuehua Bu, Zewei Zhang

Publication date: 2 August 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01053-2

zbMATH Keywords

cyclegirthplanar graph2-distance coloring

Mathematics Subject Classification ID

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

Cites Work

• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• 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
• List 2-distance coloring of planar graphs with girth five
• A bound on the chromatic number of the square of a planar graph
• List Colouring Squares of Planar Graphs
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph

This page was built for publication: 2-distance coloring of planar graphs without adjacent 5-cycles