In Most 6-regular Toroidal Graphs All 5-colorings are Kempe Equivalent
Daniel W. Cranston, Reem Mahmoud

TL;DR
This paper proves that in most 6-regular toroidal graphs, all 5-colorings are Kempe equivalent, extending known results for 6-colorings and connecting graph coloring to statistical mechanics.
Contribution
It establishes that all 5-colorings of certain 6-regular toroidal graphs are Kempe equivalent, answering a previously open question for graphs with specific embedding properties.
Findings
All 6-colorings of $T[m\times n]$ are 6-equivalent.
All 5-colorings of $T[m\times n]$ are 5-equivalent for $m,n\ge 6$.
5-colorings are Kempe equivalent in 6-regular graphs with large non-contractible cycles.
Abstract
A Kempe swap in a proper coloring interchanges the colors on some maximal connected 2-colored subgraph. Two -colorings are -equivalent if we can transform one into the other using Kempe swaps. The triangulated toroidal grid, , is formed from (a toroidal embedding of) the Cartesian product of and by adding parallel diagonals inside all 4-faces. Mohar and Salas showed that not all 4-colorings of are 4-equivalent. In contrast, Bonamy, Bousquet, Feghali, and Johnson showed that all 6-colorings of are 6-equivalent. They asked whether the same is true for 5-colorings. We answer their question affirmatively when . Further, we show that if is 6-regular with a toroidal embedding where every non-contractible cycle has length at least 7, then all 5-colorings of are 5-equivalent. Our results relate to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Topological and Geometric Data Analysis
