A very simple algorithm for estimating the number of k-colourings of a low-degree graph /
Jerrum, Mark.
University of Edinburgh.Laboratory for Foundations of Computer Science.
Edinburgh : LFCS, Dept. of Computer Science, University of Edinburgh,
1994.
Includes bibliographical references.
Graph theory.
Markov processes.