2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
From MaRDI portal
Publication:1045187
DOI10.1016/j.disc.2009.06.029zbMath1184.05040OpenAlexW2055357224MaRDI QIDQ1045187
Oleg V. Borodin, Anna O. Ivanova
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.06.029
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Planar graphs of girth at least five are square \((\delta + 2)\)-choosable ⋮ An improved bound on 2-distance coloring plane graphs with girth 5 ⋮ Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ 2-distance coloring of a planar graph without 3, 4, 7-cycles ⋮ Sharp upper bound of injective coloring of planar graphs with girth at least 5 ⋮ Graph \(r\)-hued colorings -- a survey ⋮ A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5 ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ An optimal square coloring of planar graphs ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ List 2-distance coloring of planar graphs ⋮ List injective colorings of planar graphs ⋮ Bounding the chromatic number of squares of \(K_4\)-minor-free graphs ⋮ Injective choosability of planar graphs of girth five and six ⋮ 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ Coloring the square of graphs whose maximum average degree is less than 4 ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree ⋮ 2-distance colorings of integer distance graphs ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ An introduction to the discharging method via graph coloring ⋮ On 2-distance coloring of plane graphs with girth 5 ⋮ Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 ⋮ Injective colorings of sparse graphs ⋮ List injective coloring of planar graphs with girth \(g \geq 6\) ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ 2-Distance coloring of planar graph ⋮ The list 2-distance coloring of a graph with Δ(G) = 5 ⋮ 2-distance choice number of planar graphs with maximal degree no more than 4
Cites Work
- Distance constrained labelings of planar graphs with no short cycles
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- List \((p,q)\)-coloring of sparse plane graphs
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
- 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
- Coloring Powers of Planar Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
