A very simple algorithm for estimating the numberof k-colourings of a low-degree graph
By: Mark Jerrum.
Contributors: University of Edinburgh. Laboratory for Foundations of Computer Science.
Series: LFCS report series -- ECS-LFCS-94-290
Publisher: LFCS, Dept. of Computer Science, University of Edinburgh
Published: 1994
Place of publication: Edinburgh
Language: eng
Number of pages: 10
Subjects: Graph theory.; Markov processes.
Notes: Includes bibliographical references.