About Approximate Counting of Graph Colorings

Algorithms to estimate the number of k-colorings of a low-degree graph using samplings from a markov chain are provided.