A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Kempe changes in degenerate graphs
[article]
2021
arXiv
pre-print
We consider Kempe changes on the k-colorings of a graph on n vertices. If the graph is (k-1)-degenerate, then all its k-colorings are equivalent up to Kempe changes. However, the sequence between two k-colorings that arises from the proof may be exponential in the number of vertices. An intriguing open question is whether it can be turned polynomial. We prove this to be possible under the stronger assumption that the graph has treewidth at most k-1. Namely, any two k-colorings are equivalent up
arXiv:2112.02313v1
fatcat:rujfqomiebgr3pbtyvoeoii7gq