Cover image not available

A very simple algorithm for estimating the number of k-colourings of a low-degree graph

Mark Jerrum

Publication Data

Title A very simple algorithm for estimating the number of k-colourings of a low-degree graph
Author Mark Jerrum
Contributor
Publisher LFCS, Dept. of Computer Science, University of Edinburgh
Publication date 1994
Publication location Edinburgh
Language English

Topics

Graph theory
Markov processes

Catalogue Data

OBNB ID GB9454612
ISBN 10 n/a
ISBN 13 n/a
Type BibliographicResource, Book

ISBD

P1053 10 p.
P1042 Includes bibliographical references.

Buy a copy

OBNB doesn't sell books, but you may be able to find a copy at one of these websites:

A very simple algorithm for estimating the number of k-colourings of a low-degree graph by Mark Jerrum. Published by LFCS, Dept. of Computer Science, University of Edinburgh in 1994. Publication and catalogue information, links to buy online and reader comments.

obnb.uk is a Good Stuff website.