The Markov chain of colourings

DOI10.1007/3-540-59408-6_66zbMath1501.05005OpenAlexW1546327314MaRDI QIDQ5101430

J. E. Bartels, Dominic J. A. Welsh

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_66

zbMATH Keywords

chromatic numbermean colour number

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

A note on the shameful conjecture ⋮ Two chromatic polynomial conjectures ⋮ Bounds for mean colour numbers of graphs ⋮ Problems on chromatic polynomials of hypergraphs ⋮ Mean color numbers of some graphs ⋮ Proof of a chromatic polynomial conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Expansions of Chromatic Polynomials and Log-Concavity
• On the computational complexity of the Jones and Tutte polynomials
• A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph

This page was built for publication: The Markov chain of colourings