Painting Squares in 2 1 Shades
Daniel W. Cranston, Landon Rabern · 2014
Cranston and Kim conjectured that if G is a connected graph with maximum degree and G is not a Moore Graph, then ‘(G 2 ) 2 1; here ‘ is the list chromatic number. We prove their conjecture; in fact, we show that this upper bound holds even for online list chromatic number.