Havet–van den Heuvel–McDiarmid–Reed planar square list-coloring conjecture
Havet–van den Heuvel–McDiarmid–Reed planar square list-coloring conjecture
From papers
Let be a planar graph. Havet–van den Heuvel–McDiarmid–Reed conjecture.
The conjecture was disproved in 2022 by Hasanvand, although it remains open for graphs with maximum degree at least .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Daniel W. Cranston, “Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)”, arXiv:2210.05915 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.