scientific article; zbMATH DE number 5875579
From MaRDI portal
Publication:5391631
zbMath1224.05159MaRDI QIDQ5391631
Oleg V. Borodin, Anna O. Ivanova
Publication date: 6 April 2011
Full work available at URL: https://eudml.org/doc/232375
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (12)
List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ List 2-distance coloring of planar graphs with girth five ⋮ 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 ⋮ List 2-distance coloring of planar graphs ⋮ List injective colorings of planar graphs ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree ⋮ An introduction to the discharging method via graph coloring ⋮ Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6 ⋮ Injective choosability of subcubic planar graphs with girth 6 ⋮ 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\)
This page was built for publication:
