Reconfiguration graphs for vertex colorings of $P_5$-free graphs

Hui Lei, Yulai Ma, Zhengke Miao +2

For any positive integer $k$, the reconfiguration graph for all $k$-colorings of a graph $G$, denoted by ${\mathcal{R}}_k(G)$, is the graph where vertices represent the $k$-colorings…