A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph

@article{Jerrum1995AVS,
title={A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph},
author={Mark Jerrum},
journal={Random Struct. Algorithms},
year={1995},
volume={7},
pages={157-166}
}

A fully polynomial randomized approximation scheme is presented for estimating the number of (vertex) k-colorings of a graph of maximum degree A, when k 2 2A + 1.