Mixing 3-colourings in bipartite graphs
From MaRDI portal
Publication:1039431
DOI10.1016/j.ejc.2009.03.011zbMath1198.05040MaRDI QIDQ1039431
Matthew Johnson, Jan van den Heuvel, Luis Cereceda
Publication date: 30 November 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/7398/1/7398.pdf
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of compaction to irreflexive cycles
- Connectedness of the graph of vertex-colourings
- Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
- Random sampling of 3‐colorings in ℤ2
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph