Cranston–Kim conjecture on list coloring squares of graphs
Let be a connected graph with maximum degree . Let be its square, and let denote the list chromatic number of . A Moore graph is a -regular graph on vertices such that .
Cranston–Kim conjecture. If is not a Moore graph, then
References
Status
- Solved: Daniel W. Cranston and Landon Rabern. Painting Squares in Δ²−1 Shades (The Electronic Journal of Combinatorics, 2016) https://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p50
Source: Daniel W. Cranston and Landon Rabern, “Painting Squares in Δ^2-1 Shades”, arXiv:1311.1251 (2014).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.