A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm

DOI10.1088/1751-8113/42/22/225204zbMath1179.37016arXiv0901.1010OpenAlexW3103821093WikidataQ58082908 ScholiaQ58082908MaRDI QIDQ5321801

Jesús Salas, Bojan Mohar

Publication date: 15 July 2009

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.1010

zbMATH Keywords

new Kempe invariantnon-ergodicity of the Wang-Swendsen-Kotecky algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Ergodic theory (37A99)

Related Items (12)

Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs ⋮ In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ On Vizing's edge colouring question ⋮ On a recolouring version of Hadwiger's conjecture ⋮ Worm Monte Carlo study of the honeycomb-lattice loop model ⋮ Unnamed Item ⋮ On a conjecture of Mohar concerning Kempe equivalence of regular graphs ⋮ Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs ⋮ The three-state Potts antiferromagnet on plane quadrangulations ⋮ Diameter of colorings under Kempe changes ⋮ Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus

This page was built for publication: A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm