Publication:5391631
From MaRDI portal
zbMath1224.05159MaRDI QIDQ5391631
Oleg V. Borodin, Anna O. Ivanova
Publication date: 6 April 2011
Full work available at URL: https://eudml.org/doc/232375
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
A new result of list 2-distance coloring of planar graphs with g(G) ≥ 5, Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable, An introduction to the discharging method via graph coloring, Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6, List injective colorings of planar graphs, List injective coloring of planar graphs with girth \(g \geq 6\), Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\), List 2-distance coloring of planar graphs, List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles, Injective choosability of subcubic planar graphs with girth 6, List 2-distance coloring of planar graphs with girth five, 2-distance choosability of planar graphs with a restriction for maximum degree