Recolorability of \((2K_2,K_4)\)-Free Graphs
Henry Echeverría and Owen Henderschedt
This page contains computer-assisted parts of our work on the recolorability of \((2K_2,K_4)\)-free graphs.
On the recolorability of \((2K_2,K_4)\)-free graphs
Henry Echeverría and Owen Henderschedt
Yes, \((2K_2,K_4)\)-free graphs are recolorable
Henry Echeverría and Owen Henderschedt
The verification code for the second paper is available here .