Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs

DOI10.1002/jgt.20613zbMath1242.05099arXiv1005.2248OpenAlexW2111678564MaRDI QIDQ2888891

Jessica McDonald, Diego Scheide, Bojan Mohar

Publication date: 4 June 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

coloringedgeKempe changes

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results ⋮ Reflexive coloring complexes for 3-edge-colorings of cubic graphs ⋮ Hamiltonian cycles and 1-factors in 5-regular graphs ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ On Vizing's edge colouring question ⋮ Kempe equivalent list edge-colorings of planar graphs ⋮ Kempe equivalence of colourings of cubic graphs ⋮ On a conjecture of Mohar concerning Kempe equivalence of regular graphs ⋮ Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs ⋮ Kempe equivalence of colourings of cubic graphs ⋮ Introduction to reconfiguration ⋮ Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus

Cites Work

• Antiferromagnetic Potts models on the square lattice: A high-precision Monte Carlo study
• A constrained Potts antiferromagnet model with an interface representation
• A new Kempe invariant and the (non)-ergodicity of the Wang–Swendsen–Kotecký algorithm

This page was built for publication: Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs