Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable

zbMath1076.05032MaRDI QIDQ2575546

T. K. Neustroeva, Oleg V. Borodin, Anna O. Ivanova, V. A. Tashkinov, Alekseĭ Nikolaevich Glebov

Publication date: 12 December 2005

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51820

zbMATH Keywords

diameterchromatic numbercoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (26)

List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ 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 list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Degeneracy and colorings of squares of planar graphs without 4-cycles ⋮ Graph \(r\)-hued colorings -- a survey ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ List injective colorings of planar graphs ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ Coloring squares of planar graphs with girth six ⋮ \(k\)-forested coloring of planar graphs with large girth ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ 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 ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ List coloring the square of sparse graphs with large degree ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)

This page was built for publication: Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable