📝 SummarXiv

Abstract

Given a graph $G$, the \emph{reconfiguration graph of the $\ell$-colorings} of $G$, denoted by ${\cal R}_\ell(G)$, is the graph whose vertices are the $\ell$-colorings of $G$ and two $\ell$-colorings are joined by an edge if they differ on exactly one vertex of $G$. A graph $G$ is \emph{$\ell$-mixing} if ${\cal R}_\ell(G)$ is connected and the \emph{$\ell$-recoloring diameter} of $G$ is the diameter of ${\cal R}_\ell(G)$. An interesting classification problem that recently gathered a wide attention is the following: ``{\em Given a hereditary class of graphs $\cal C$ and any graph $G\in \cal C$, classify whether $G$ is $\ell$-mixing or not for any $\ell> \chi(G)$}, where $\chi(G)$ is the chromatic number of $G$." In this paper, we answer this problem for the class of $(P_2+P_3, C_4)$-free graphs, and moreover, if such a graph $G$ is recolorable, then for all $\ell >\chi(G)$, the $\ell$-recoloring diameter of $G$ is at most 2$n^{2}$. Furthermore, Cereceda conjectured that if $G$ is a graph on $n$ vertices with degeneracy $d$, then for all $\ell \geq d+ 2$, the $\ell$-recoloring diameter of $G$ is at most $O(n^2)$. We prove that every ($P_2+P_3, C_4$)-free graph satifies Cereceda's conjecture.