A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Recoloring graphs via tree decompositions
[article]
2014
arXiv
pre-print
Let k be an integer. Two vertex k-colorings of a graph are adjacent if they differ on exactly one vertex. A graph is k-mixing if any proper k-coloring can be transformed into any other through a sequence of adjacent proper k-colorings. Jerrum proved that any graph is k-mixing if k is at least the maximum degree plus two. We first improve Jerrum's bound using the grundy number, which is the worst number of colors in a greedy coloring. Any graph is (tw+2)-mixing, where tw is the treewidth of the
arXiv:1403.6386v1
fatcat:ocsgjngk75gc7bmugne7hjdppi