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




Related Items

Planar graphs of girth at least five are square \((\delta + 2)\)-choosableAn improved bound on 2-distance coloring plane graphs with girth 5Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors2-distance coloring of a planar graph without 3, 4, 7-cyclesSharp upper bound of injective coloring of planar graphs with girth at least 5Graph \(r\)-hued colorings -- a surveyA new result of list 2-distance coloring of planar graphs with g(G) ≥ 52-distance coloring of planar graphs with girth 5An optimal square coloring of planar graphsGraphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorableList 2-distance coloring of planar graphsList injective colorings of planar graphsBounding the chromatic number of squares of \(K_4\)-minor-free graphsInjective choosability of planar graphs of girth five and six2-Distance coloring of planar graphs without triangles and intersecting 4-cyclesColoring squares of planar graphs with maximum degree at most fiveColoring the square of graphs whose maximum average degree is less than 42-distance choosability of planar graphs with a restriction for maximum degree2-distance colorings of integer distance graphsList 2-facial 5-colorability of plane graphs with girth at least 12An introduction to the discharging method via graph coloringOn 2-distance coloring of plane graphs with girth 5Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6Injective colorings of sparse graphsList injective coloring of planar graphs with girth \(g \geq 6\)The \(L(p, q)\)-labelling of planar graphs without 4-cyclesList‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles2-Distance coloring of planar graphThe list 2-distance coloring of a graph with Δ(G) = 52-distance choice number of planar graphs with maximal degree no more than 4



Cites Work


This page was built for publication: 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)