An improved bound on 2-distance coloring plane graphs with girth 5
From MaRDI portal
Publication:306114
DOI10.1007/s10878-015-9888-4zbMath1343.05061OpenAlexW2034887806MaRDI QIDQ306114
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Optimal channel assignment and \(L(p,1)\)-labeling ⋮ List 2-distance coloring of planar graphs with girth five ⋮ Sharp upper bound of injective coloring of planar graphs with girth at least 5 ⋮ 2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Graph \(r\)-hued colorings -- a survey ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ On 2-distance coloring of plane graphs with girth 5 ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ 2-Distance chromatic number of some graph products
Cites Work
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: An improved bound on 2-distance coloring plane graphs with girth 5
