2-distance coloring of sparse planar graphs
From MaRDI portal
Publication:2577174
zbMath1077.05040MaRDI QIDQ2577174
T. K. Neustroeva, Anna O. Ivanova, Oleg V. Borodin
Publication date: 19 December 2005
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/51860
Related Items (18)
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 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 ⋮ 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 ⋮ On 2-distance coloring of plane graphs with girth 5 ⋮ Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 ⋮ Unnamed Item ⋮ List injective coloring of planar graphs with girth \(g \geq 6\) ⋮ List coloring the square of sparse graphs with large degree ⋮ 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\) ⋮ A characterization of graphs with regular distance-2 graphs
This page was built for publication: 2-distance coloring of sparse planar graphs
