2-distance coloring of a planar graph without 3, 4, 7-cycles

DOI10.1007/s10878-015-9873-yzbMath1348.05071OpenAlexW2008200916MaRDI QIDQ328716

Xia Lv, Yuehua Bu

Publication date: 20 October 2016

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

Full work available at URL: https://doi.org/10.1007/s10878-015-9873-y

zbMATH Keywords

cyclesplanar 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)

Related Items (1)

The \(k\)-distance chromatic number of trees and cycles

Cites Work

• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• 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
• Coloring the square of a planar graph
• 2-Distance coloring of planar graphs without short cycles

This page was built for publication: 2-distance coloring of a planar graph without 3, 4, 7-cycles