Kempe equivalence of 4-colourings of some plane triangulations
Jan Florek

TL;DR
This paper investigates the structure of 4-colourings in certain plane triangulations with specific degree properties, enumerates Kempe classes, and demonstrates the Kempe equivalence of colourings after removing a pole, revealing multiple new structural insights.
Contribution
It introduces the enumeration of Kempe classes for a family of plane triangulations and proves Kempe equivalence of colourings after pole removal, advancing understanding of colouring transformations.
Findings
Number of Kempe classes is at least loor(n/6)or the graph family.
All 4-colourings of H_n are Kempe equivalent up to loor(13n/2)hanges.
Enumeration of the total number of 4-colourings for G_n.
Abstract
Let , where , be a simple plane triangulation which has non-adjacent vertices of degree (called \textit{poles} of ) and vertices of degree~. A set of Kempe equivalent -colourings of is called a \textit{Kempe class}. The number of Kempe classes of is enumerated. In particular it is shown that there is at least Kempe classes of . We say that -colourings of are \textit{equal} if there exists a permutation~ of the set of colours such that . Otherwise, , are \textit{different}. The number of different -colourings of is enumerated. Suppose that , where is a pole of . We prove that all -colourings of are Kempe equivalent up to Kempe changes. % ($\lfloor…
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
TopicsFinite Group Theory Research · Advanced Combinatorial Mathematics · Advanced Graph Theory Research
