A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph

This publication has 7 references indexed in Scilit:

• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Comment on ‘‘Antiferromagnetic Potts models’’
  Physical Review Letters, 1993
• Group representations in probability and statistics
  Published by Institute of Mathematical Statistics ,1988
• Random generation of combinatorial structures from a uniform distribution
  Theoretical Computer Science, 1986
• Random walks on finite groups and rapidly mixing markov chains
  Published by Springer Nature ,1983
• Decay of correlations in classical lattice models at high temperature
  Communications in Mathematical Physics, 1979
• On colouring the nodes of a network
  Mathematical Proceedings of the Cambridge Philosophical Society, 1941