Frozen colourings of bounded degree graphs
type: Item
instance of: scholarly article
title: Frozen colourings of bounded degree graphs
zbMATH Open document ID: 1397.05058
author: Marthe Bonamy
author: Nicolas Bousquet
author: Guillem Perarnau
publication date: 2018-10-11T00:00:00Z
full work available at URL: DMD frozen.pdf
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6952003
zbMATH Keywords: graph colourings
zbMATH Keywords: recolouring graph
zbMATH Keywords: random colourings
zbMATH Keywords: Glauber dynamics
MaRDI profile type: Publication
OpenAlex ID: W2884093028
cites work: The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
cites work: Q5315023
cites work: Systematic scan for sampling colorings
cites work: A reconfigurations analogue of Brooks' theorem and its consequences
cites work: Q3447279
cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
cites work: Q4941948
cites work: Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
cites work: Reconfiguration of dominating sets
cites work: The complexity of change
cites work: Improved bounds for sampling colorings
DOI: 10.1016/J.ENDM.2018.06.029
description: scientific article; zbMATH DE number 6952003