Efficient Total Coloring in Toroidal Graphs

• The paper introduces efficient total coloring on toroidal graphs, achieving reduced color usage through innovative decomposition techniques.
• It employs key structural properties such as vertex arboricity bounds and (d,h)-decomposability to optimize both vertex and edge colorings.
• Leveraging explicit constructions like honeycomb toroidal graphs and Schnyder woods, the research uncovers new geometric and algorithmic insights.

A toroidal graph is a finite graph that admits an embedding (without edge crossings) on the orientable surface of genus one—that is, the standard torus. The study of toroidal graphs bridges topological graph theory, combinatorics, spectral theory, algebraic constructions, and geometric representations. Toroidal graphs display structural and algorithmic properties distinct both from planar graphs (embeddable on the sphere) and from graphs embeddable on surfaces of higher genus.

1. Definitions, Core Properties, and Embedding Criteria

A graph $G$ is toroidal if it can be embedded in the torus (the surface $\mathbb{S}^1\times\mathbb{S}^1$) without edge crossings, equivalently if the genus $g(G)\leq 1$. Toroidal maps are 2-cell embeddings of $G$ on the torus, where every face is a topological disk.

Key fundamental properties:

• Euler characteristic: For a toroidal map with $n$ vertices, $m$ edges, $f$ faces,

$n - m + f = 0.$

• Essential $k$-connectivity: A toroidal map is essentially $k$-connected if its universal cover, a periodic planar tiling, is $k$-connected.

Harary & Wall’s classical characterization identifies forbidden minors for toroidality, but complete structural forbidden minor characterizations are elusive due to the diversity of toroidal graphs.

2. Structural Theorems, Decomposability, and Arboricity

Toroidal graphs exhibit intermediate constraints between planar and higher-genus graphs:

• Vertex arboricity $a(G)$ (minimum $k$ such that $V(G)$ can be partitioned into $k$ forests) satisfies $a(G)\leq 4$ for all toroidal $G$ (Choi et al., 2013).
  • Forbidding small cycles sharpens this: toroidal graphs without $k$-cycles, for $k=3,4,5$, have $a(G) \leq 2$. The case $k=4$ closes the gap: if $G$ is toroidal with no $4$-cycles, $a(G) \leq 2$.
  • The proof uses minimal counterexample analysis and a discharging procedure with nuanced reducibility arguments; key is the absence of certain local configurations ruled out by forbidding $4$-cycles.
• $(d,h)$-decomposability (Wang et al., 26 Feb 2025): For families $\mathcal T_{i,j}$ of toroidal graphs forbidding both $i$- and $j$-cycles for pairs $(i, j)\in\{(3,4),(3,6),(4,6),(4,7)\}$, every such $G$ is $(2,1)$-decomposable (contains a subgraph of maximum degree at most $1$, with the rest $2$-degenerate). This implies defective colorings and further defective choosability results.

3. Explicit Constructions and Classification Families

Cayley and Highly Symmetric Toroidal Graphs

• Honeycomb toroidal graphs $\mathrm{HTG}(m,n,\ell)$ (Alspach, 2020) are 3-regular Cayley graphs of generalized dihedral groups $D_n$ with three reflections as generators:

$\mathrm{HTG}(m,n,\ell) = \mathrm{Cay}(D_n; S)$

These are vertex-transitive, have a canonical embedding on the torus where every face is a hexagon, and generalize important models in topological graph theory and interconnection network design. Most $\mathrm{HTG}(m,n,\ell)$ are bipartite with girth 6, though specific parameter choices yield girth 4.

• Generalized Heawood graphs $H(n_1,\ldots,n_{d+1})$ (Ceballos et al., 2023) are constructed as quotients of permutahedral tilings. For $d=2$, they include the classical Heawood graph (dual to the minimal triangulation of the torus by 7 hexagons). These graphs are dual to highly symmetric triangulated tori in higher dimension and exhibit automorphism groups combining lattice translations and coordinate permutations.
• Toroidal involutory Cayley graphs (Keshavarzi et al., 2 Aug 2025) classify all finite commutative rings $R$ whose involutory Cayley graph $\mathcal{G}(R)$ (where $x\sim y$ iff $(x-y)^2=1$) is toroidal. Precisely characterized families include local rings of even characteristic of specified types and certain cyclic/Cartesian products of odd- and even-order rings; structural genus calculations use spanning subgraphs such as $K_{4,4}$ and products of cycles.

Enumeration of Semi-equivelar Maps

There are exactly eleven types of semi-equivelar toroidal maps—maps where all vertices have the same cyclic face-sequence (Maity et al., 2013). For eight new types, explicit $T(r,s,k)$-parameterizations and symmetry classes are given, with algorithmic classification of isomorphism types for small $n$. These enumeration results are crucial for cataloging the families of vertex-transitive or edge-transitive toroidal maps.

4. Representation Theorems and Geometric Models

• Visibility representations: Every loopless toroidal graph (no loops, possibly multiple edges) can be represented as a visibility graph on a rectangular flat torus (Biedl, 2022). The construction proceeds by reduction to a planar subproblem, reserves columns for "wrapping" edges, and ultimately yields layouts with explicit coordinate bounds. This resolves an open problem of Mohar & Rosenstiehl.
• Schnyder woods and grid embeddings: Generalized Schnyder woods exist on essentially 3-connected toroidal maps (Gonçalves et al., 2012). They induce orthogonal-surface periodic embeddings of the universal cover, enabling straight-line drawings in $O(n^2)$ area. The characterization of toroidal Schnyder woods is both local (at each vertex) and global (cycle intersection), extending classic results from planar triangulations. There are open questions concerning distributive lattice structures and extensions to higher genus.
• Delaunay triangulations minimizing energy: For weighted toroidal graphs, the existence and uniqueness of energy-minimizing (harmonic) embeddings into an optimal flat torus structure coincide with realization as weighted Delaunay decompositions, linking equilibrium Laplacians, dual Voronoi cells, and Maxwell–Cremona conjugacy. This provides an analytical foundation for geometric optimization on tori (Lam, 2022).

5. Metric, Spectral, and Algorithmic Properties

• Average effective resistance: In the $d$-dimensional toroidal grid $T_n^d = \Box^d C_n$, the average resistance $R_{\mathrm{avg}}(T_n^d)$ is closely tied to Laplacian eigenvalues and random walk hitting times. For $d \geq 3$, $R_{\mathrm{avg}}(T_n^d) = O(1/d)$ uniformly in $n$; this reflects high connectivity and rapid mixing in large toroidal lattices (Rossi et al., 2017).
• Hamiltonicity and cycle structure: Families such as honeycomb toroidal graphs are even pancyclic (every even cycle length in range) except for specific parameter values. For most $\mathrm{HTG}(m,n,\ell)$, the Hamilton-laceability is unresolved; the Chen–Quimpo theorem for abelian Cayley graphs suggests this remains an active direction.
• Automorphisms: Highly symmetric toroidal graphs (Cayley, Heawood-type) possess automorphism groups that combine translational symmetries (fundamental domain shifts) with permutation groups. Exceptional cases (e.g., palindromic $k$-vectors in generalized Heawood graphs) can produce larger symmetry groups (Ceballos et al., 2023).

6. Topological, Spatial, and Knot-theoretic Aspects

• Spatial embeddings and knotting: Any embedding of an abstractly planar graph into the standard torus in $\mathbb{R}^3$ either is ambient isotopic to a planar embedding or must create a nontrivial knot or nonsplit link (Barthel et al., 2015). "Ravels"—entanglements without knotted or linked cycles—are impossible on the torus and require surfaces of genus at least two. This is significant for spatial graph theory, chemistry, and molecular design.
• Triangulations and dual complexes: The dual cell complexes of generalized Heawood graphs correspond to minimal, highly symmetric triangulations of $d$-tori, with explicit $f$-vector formulas and tight connections to permutahedral tilings.

7. Open Problems and Current Research Directions

The toroidal graph landscape entails several prominent open questions:

• Hamilton-laceability and explicit geodesics in Cayley and honeycomb toroidal graphs.
• Structural obstructions and minimal non-2-decomposable toroidal graphs, especially for higher genus and more general forbidden subgraphs.
• Complete characterization of automorphism groups of highly symmetric toroidal graphs beyond translations and permutations.
• Algorithmic efficiency and compact encodings for visibility and straight-line representations on the torus, including linear-time algorithms and grid compactness.
• Generalization of Schnyder wood structures to triangulations of surfaces with $g\geq2$, and their connection to contact and intersection graph models.
• Metric invariants and spectral gap behavior in non-lattice toroidal graphs and higher-dimensional periodic complexes.

The intersection of combinatorial, geometric, algebraic, and topological properties in toroidal graphs continues to drive new results across graph theory, geometry, and discrete mathematics.