Enumeration of plane triangulations with all vertices of degree $3$ or $6$ and a new characterization of akempic triangulations
Jan Florek
TL;DR
The work addresses the enumeration of plane triangulations with all vertices of degree $3$ or $6$ and introduces a new characterization of akempic triangulations. It develops an index-vector framework $(K(q), M(q), S^{+}(q))$, leverages $\theta$-billiard sequences and Farey structures to propagate these indices, and incorporates symmetry and non-simple reductions to achieve complete enumeration results. The major contributions include a simple, new akempic criterion based on $\gcd$ conditions on index components, a streamlined proof of Mohar's enumeration, and a closed-form enumeration $d(n)$ in terms of divisor functions and congruence counts. Together, these results deepen the combinatorial understanding of colorings in constrained plane triangulations and offer a concise route to Mohar's theorems.
Abstract
Plane triangulations with all vertices of degree $3$ or $6$ are enumerated. A plane triangulation is said to be akempic if it has a $4$-colouring such that no two adjacent triangles have the same three colours and this colouring is not Kempe equivalent to any other colouring. Mohar (1985 and 1987) characterized and enumerated akempic triangulations with all vertices of degree $3$ or $6$. We give a new characterization of the akempic triangulations and a new proof of the Mohar enumeration theorem.
