The Markov chain of colourings
Authors:
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 373-387
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graphRandom Structures & Algorithms, 1995
- Algorithms for Random Generation and Counting: A Markov Chain Approach1993
- Expansions of chromatic polynomials and log-concavityTransactions of the American Mathematical Society, 1992
- On the computational complexity of the Jones and Tutte polynomialsMathematical Proceedings of the Cambridge Philosophical Society, 1990