A fully polynomial randomized approximation scheme is presented for estimating the number of (vertex) k ‐colorings of a graph of maximum degree Δ, when k ≥ 2Δ + 1.
No takes yet. Share an insight, caveat, or question.
Mark Jerrum (1995) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: