Choosability of the square of a planar graph with maximum degree four

zbMath1296.05053arXiv1303.5156MaRDI QIDQ2876030

Rok Erman, Riste Škrekovski, Daniel W. Cranston

Publication date: 15 August 2014

Full work available at URL: https://arxiv.org/abs/1303.5156

zbMATH Keywords

list chromatic numbermaximum average degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Graph \(r\)-hued colorings -- a survey ⋮ List 2-distance coloring of planar graphs ⋮ Square Coloring Planar Graphs with Automatic Discharging ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ An introduction to the discharging method via graph coloring

This page was built for publication: Choosability of the square of a planar graph with maximum degree four