Counting and sampling \(H\)-colourings
type: Item
instance of: scholarly article
title: Counting and sampling \(H\)-colourings
zbMATH Open document ID: 1082.68079
author: Leslie Ann Goldberg
author: Martin Dyer
author: Mark Jerrum
published in: Information and Computation
publication date: 2004-11-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 2118409
MaRDI profile type: Publication
full work available at URL: j.ic.2003.09.001
OpenAlex ID: W1977104034
Wikidata QID: Q56323928
cites work: Gibbs measures and dismantlable graphs
cites work: On Markov chains for randomly \(H\)-coloring a graph
cites work: Q4263659
cites work: Q4521549
cites work: Q4440428
cites work: Computation in permutation groups: Counting and randomly sampling orbits
cites work: The computational complexity of two‐state spin systems
cites work: The complexity of choosing an H -colouring (nearly) uniformly at random
cites work: Foundations of Cryptography
cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
cites work: Q4798347
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: Q3221403
DOI: 10.1016/J.IC.2003.09.001
description: scientific article; zbMATH DE number 2118409