Chromatic-choosability of the power of graphs

Seog-Jin Kim, Young Soo Kwon, Boram Park

The $k$th power $G^k$ of a graph $G$ is the graph defined on $V(G)$ such that two vertices $u$ and $v$ are adjacent in $G^k$ if the distance between $u$ and $v$ in $G$ is at most $…