paper

Randomly coloring graphs of bounded treewidth

arXiv:1708.02677

Abstract

We consider the problem of sampling a proper -coloring of a graph of maximal degree uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of bounded treewidth if , for any .

References in corpus (3)

Cited by in corpus (2)