An improved bound on 2-distance coloring plane graphs with girth 5

DOI10.1007/s10878-015-9888-4zbMath1343.05061MaRDI QIDQ306114

Wensong Lin, Wei Dong

Publication date: 31 August 2016

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

Full work available at URL: https://doi.org/10.1007/s10878-015-9888-4

zbMATH Keywords

girth; plane graph; 2-distance coloring

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

Related Items

On 2-distance coloring of plane graphs with girth 5, Optimal channel assignment and \(L(p,1)\)-labeling, 2-distance coloring of planar graphs with girth 5

Cites Work

• Unnamed Item
• Unnamed Item
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• An optimal square coloring of planar graphs
• \(L(p,q)\)-labeling of sparse graphs
• Coloring squares of planar graphs with girth six
• A bound on the chromatic number of the square of a planar graph
• Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
• 2-distance coloring of sparse planar graphs
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Coloring the square of a planar graph