Painting Squares in $\Delta^2-1$ Shades

[摘要] Cranston and Kim conjectured that if $G$ is a connected graph with maximum degree $\Delta$ and $G$ is not a Moore Graph, then $\chi_{\ell}(G^2)\le \Delta^2-1$; here $\chi_{\ell}$ is the list chromatic number. We prove their conjecture; in fact, we show th

[学科分类] 离散数学和组合数学

[关键词] List coloring;Online list coloring;Paint number;Square;Moore graph