2-distance coloring of planar graphs with girth 5
From MaRDI portal
Publication:1679523
DOI10.1007/s10878-017-0148-7zbMath1373.05063OpenAlexW2726123099MaRDI QIDQ1679523
Publication date: 9 November 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0148-7
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
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 without adjacent 5-cycles ⋮ 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles ⋮ 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\) ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ On \(d_2\)-coloring of certain families of graphs ⋮ 2-Distance chromatic number of some graph products ⋮ 2-Distance coloring of planar graph
Cites Work
- Unnamed Item
- An improved bound on 2-distance coloring plane graphs with girth 5
- Injective coloring of planar graphs with girth 6
- Injective coloring of plane graphs with girth 5
- On 2-distance coloring of plane graphs with girth 5
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- Injective colorings of graphs with low average degree
- List injective colorings of planar graphs
- Injective colorings of sparse graphs
- Some bounds on the injective chromatic number of graphs
- Injective colorings of planar graphs with few colors
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- On the injective chromatic number of graphs
- An optimal square coloring of planar graphs
- Colorings of plane graphs: a survey
- 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: 2-distance coloring of planar graphs with girth 5