![](/files/happy5.png)
square of a graph
Choosability of Graph Powers ★★
Author(s): Noel
Question (Noel, 2013) Does there exist a function
such that for every graph
,
![$ f(k)=o(k^2) $](/files/tex/bd642e5dd66f1577cedf5fed57f75187a80168ac.png)
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![\[\text{ch}\left(G^2\right)\leq f\left(\chi\left(G^2\right)\right)?\]](/files/tex/989db06683633e86605c26e7d9f0bffc7e46a496.png)
Keywords: choosability; chromatic number; list coloring; square of a graph
![Syndicate content Syndicate content](/misc/feed.png)
Author(s): Noel
Keywords: choosability; chromatic number; list coloring; square of a graph