English

Note on $4$-coloring $6$-regular triangulations on the torus

Combinatorics 2022-10-11 v2

Abstract

In 1973, Altshuler characterized the 66-regular triangulations on the torus to be precisely those that are obtained from a regular triangulation of the r×sr \times s toroidal grid where the vertices in the first and last column are connected by a shift of tt vertices. Such a graph is denoted T(r,s,t)T(r, s, t). In 1999, Collins and Hutchinson classified the 44-colorable graphs T(r,s,t)T(r, s, t) with r,s3r, s \geq 3. In this paper, we point out a gap in their classification and show how it can be fixed. Combined with the classification of the 44-colorable graphs T(1,s,t)T(1, s, t) by Yeh and Zhu in 2003, this completes the characterization of the colorability of all the 66-regular triangulations on the torus.

Keywords

Cite

@article{arxiv.2106.01037,
  title  = {Note on $4$-coloring $6$-regular triangulations on the torus},
  author = {Brahadeesh Sankarnarayanan},
  journal= {arXiv preprint arXiv:2106.01037},
  year   = {2022}
}

Comments

9 pages, 1 figure

R2 v1 2026-06-24T02:44:36.264Z