On 2-distance coloring of plane graphs with girth 5
From MaRDI portal
Publication:516880
DOI10.1016/j.dam.2016.07.026zbMath1358.05101OpenAlexW2554513534MaRDI QIDQ516880
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.07.026
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items
2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles
Cites Work
- Unnamed Item
- An improved bound on 2-distance coloring plane graphs with girth 5
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- 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
- 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
This page was built for publication: On 2-distance coloring of plane graphs with girth 5