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. 
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 320 citations. REVIEW CITATIONS

Topics

Statistics

0102030'96'99'02'05'08'11'14'17
Citations per Year

321 Citations

Semantic Scholar estimates that this publication has 321 citations based on the available data.

See our FAQ for additional information.