List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six

DOI10.1016/j.ejc.2008.12.019zbMath1190.05055OpenAlexW2005210416MaRDI QIDQ1024323

Anna O. Ivanova, Oleg V. Borodin

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.12.019

zbMATH Keywords

planar graphslist colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items

Planar graphs of girth at least five are square \((\delta + 2)\)-choosable ⋮ Graph \(r\)-hued colorings -- a survey ⋮ 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 ⋮ Injective choosability of planar graphs of girth five and six ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ An introduction to the discharging method via graph coloring ⋮ Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 ⋮ List injective coloring of planar graphs with girth \(g \geq 6\) ⋮ 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\) ⋮ The list 2-distance coloring of a graph with Δ(G) = 5 ⋮ The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles ⋮ 2-distance choice number of planar graphs with maximal degree no more than 4

Cites Work

• 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
• List Colouring Squares of Planar Graphs
• Coloring Powers of Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item