Mixing 3-colourings in bipartite graphs
type: Item
instance of: scholarly article
title: Mixing 3-colourings in bipartite graphs
zbMATH Open document ID: 1198.05040
author: Luis Cereceda
author: Jan van den Heuvel
author: Matthew Johnson
published in: European Journal of Combinatorics
publication date: 2009-11-30T00:00:00Z
full work available at URL: 7398.pdf
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5640339
MaRDI profile type: Publication
OpenAlex ID: W2103875227
cites work: Q3324796
cites work: Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
cites work: Connectedness of the graph of vertex-colourings
cites work: Q3864564
cites work: Q5315023
cites work: Random sampling of 3‐colorings in ℤ2
cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
cites work: Q4798347
cites work: Computational complexity of compaction to irreflexive cycles
DOI: 10.1016/J.EJC.2009.03.011
description: scientific article; zbMATH DE number 5640339