Generating the triangulations of the torus with the vertex-labeled complete 4-partite graph K2,2,2,2

Using the orbit decomposition, a new enumerative polynomial P(x) is introduced for abstract (simplicial) complexes of a given type, e.g., trees with a fixed number of vertices or triangulations of the torus with a fixed graph. The polynomial has the following three useful properties. (I) The value P(1) is equal to the total number of unlabeled complexes (of a given type). (II) The value of the derivative P′(1) is equal to the total number of nontrivial automorphisms when counted across all unlabeled complexes. (III) The integral of P(x) from 0 to 1 is equal to the total number of vertex-labeled complexes, divided by the order of the acting group. The enumerative polynomial P(x) is demonstrated for trees and then is applied to the triangulations of the torus with the vertex-labeled complete four-partite graph G = K2,2,2,2, in which specific case P(x) = x31. The graph G embeds in the torus as a triangulation, T (G). The automorphism group of G naturally acts on the set of triangulations of the torus with the vertex-labeled graph G. For the first time, by a combination of algebraic and symmetry techniques, all vertex-labeled triangulations of the torus (twelve in number) with the graph G are classified intelligently without using computing technology, in a uniform and systematic way. It is helpful to notice that the graph G can be converted to the Cayley graph of the quaternion group Q8 with the three imaginary quaternions i, j, k as generators.


Introduction
Graph theory and its applications (polyhedra, enumeration, coloring, fullerenes, etc.) has received increasing attention in recent years [1,2,3,4,5], which has paved the way for more directions of research.
In labeled graph enumeration problems, the vertices of the graph are labeled so as to be distinguishable from each other, while in unlabeled graph enumeration problems any admissable permutation of the vertices is regarded as producing the same graph, so the vertices are considered unlabeled. In general, labeled problems are usually easier than unlabeled ones. For example, Cayley's tree formula [6,7] gives the number, n n−2 , of trees with n vertices bijectively labeled by 1, . . . , n, whereas the number of unlabeled trees with n vertices can only be evaluated as the coefficients of a generating function [8,9]. The number n n−2 can be interpreted as the number of different ways of placing n given folders on the desktop into the one a priori chosen out of them and fixed (the root folder). The orbit decomposition [10] is an important tool for reducing unlabeled problems to labeled ones: Each unlabeled class is considered as a symmetry class, or an isomorphism class, of labeled graphs. In the current paper we introduce a new enumerative polynomial P(x) which is a bridge between the labeled and unlabeled settings.
A graph consists of a finite set of vertices, some of which are connected by edges. To "embed a graph in a surface" is, loosely speaking, to draw it on that surface without any edges crossing. An embedding of a graph in a surface is a closed 2-cell embedding if the surface breaks up into a union of connected components, the faces of the embedding, each of which is bounded by a (simple) cycle (without repeated vertices) in the graph. A closed 2-cell embedding of a graph in a surface is called triangular or a triangulation if each face is triangular, that is, bounded by a cycle of length 3 (that is, consisting of three edges) of the graph embedded. Throughout this paper we assume all graphs to be simple, that is, without loops or multiple edges. Unlabeled graphs are considered up to isomorphism. For example, all vertexlabeled cycles of length 5 are isomorphic and thus represent the same unlabeled graph, C 5 , up to isomorphism. The vertices of this graph can be assigned labels 1, 2, 3, 4, 5 in twelve different ways. Furthermore, the twelve different vertex-labeled graphs split into six pairs of graphs which are the complementarities of each other (in each pair); one such pair is shown in Figure 1. (See Remark 1 at the end of Section 6.) Graphs can be thought of as simplicial 1-complexes (that is, 1-dimensional complexes) while triangulations of surfaces can be thought of as simplicial 2-complexes. In general, a simplicial complex K is a collection of simplices which satisfies the following conditions: Every face of a simplex of K is a simplex of K , and the intersection of any two simplices in K is either empty or is a face of both. A simplicial d-complex is a simplicial complex in which the largest dimension of any simplex is d. Combinatorics studies abstract simplicial complexes, while geometry studies geometric simplicial complexes. Two triangulations are called isomorphic provided there is a bijection between their vertex sets, which sends edges to edges and faces to faces. Two triangulations with the same vertex-labeled graph are considered different provided one has a face determined by some three vertices with specific labels while the other does not. For example, the two triangulations in the upper row of Figure 8(b) are different because the one in the left-hand side has a face with vertex labels 1, j, k while the one in the right-hand side does not; the reader may notice that the two triangulations have no (2-)faces in common (just like the complementary graphs in Figure 1 have no 1faces (edges) in common) and that they are complementary of each other as labeled simplicial 2-complexes. On the other hand, the two triangulations represent the same unlabeled triangulation, the 8-vertex 6-regular triangulation T (G) of the torus which is known [11,12] to be a unique (up to isomorphism) triangular embedding of the complete 4-partite graph G = K 2,2,2,2 in the torus (see Figure 2, left, identify the sides of the rectangle, in pairs, to obtain a torus). The 8-vertex graph K 2,2,2,2 is in fact the complete graph K 8 with four independent edges deleted; the complete graph K 8 has all 28 edges connecting its 8 vertices.
The results of the current paper are primarily concerned with the symmetry relations of the graph G = K 2,2,2,2 and the triangulation T (G) of the torus with this graph G (Figure 2, left). Also, the triangulation T (G) is known [11,12] as one of the twenty-one so-called irreducible triangulations of the torus. Furthermore, T (G) can be realized geometrically [13] as a toroidal polyhedral suspension in 3dimensional space R 3 , as shown in Figure 2 (right), and also as a 2-dimensional noble polyhedron in 4-dimensional space R 4 , that is, a polyhedron which is isohedral (all faces are similar) and isogonal (all vertices are similar), whose properties are studied extensively in [2].
As the main result of the current paper, it is shown ( Theorem 2, Section 6) how to generate all different triangulations of the torus, totaling 12 in number, with the vertex-labeled graph G = K 2,2,2,2 in an intelligent fashion without using computer resources. Although explicit identification of the 12 triangulations was done [14] a long time ago in 1987 by a direct exhaustive computer search (Fortran was used as a general-purpose programming language in those earlier years), the structure of the set of the 12 triangulations remained unclear up to now. The structure and a related classification of the 12 triangulations are revealed in Theorem 2 in algebraic terms of certain quotient group action. The importance of the classification obtained is seen in the geometric realization: Geometrically, the 12 vertex-labeled triangulations correspond to different (as point-sets) 2-dimensional toroidal subcomplexes of the 16-cell in R 4 . So, as a byproduct, we obtain all two-dimensional tori in the 2-skeleton of the 16-cell; their realization in a Schlegel diagram of the 16-cell would lead to new toroidal polyhedra in R 3 (a Schlegel diagram is a projection of the polytope from R 4 into R 3 through a point just outside one of its facets).

Preliminary: The orbit decomposition
This section serves as a continuation of the Introduction. The objective is to address key algebraic concepts and known results, presented in Lang's book [10]. In particular, orbit-stabilizer theory is briefly addressed. The reader will find specific illustration examples in Section 4.
In the general case, let Ω be a fixed finite set of unlabeled discrete substructures of some ambient structure. For the sake of certainty, the set Ω, = Ω n , can be thought of as a set of spanning unlabeled (that is, considered up to isomorphism) subcomplexes of some ambient n-vertex unlabeled simplicial complex K d with dimension d. Let K be a spanning simplicial subcomplex of K d . An automorphism of K is any permutation of the vertex set of K d which sends m-faces of K onto m-faces of K , for any m (0 m d). Let Ω n k be the set of unlabeled n-vertex k-symmetric simplicial subcomplexes of K d , where the term "k-symmetric" means that the automorphism group of the subcomplex has order k. Thus, In this paper, the two main instances of Ω n are as follows: (i) the set of n-vertex trees (Section 4) and (ii) the set of triangulations of the torus with the 8-vertex graph G = K 2,2,2,2 (Sections 5, 6). Let Λ n be the set obtained from the set Ω n by labeling the n vertices of each element K of Ω n with labels 1, . . . , n bijectively, in all combinatorially different ways. As matter of notation, when K is assumed to be unlabeled, we write K ∈ Ω n , while when K is understood to be vertex-labeled, we write K ∈ Λ n . Two vertex-labeled simplicial complexes K 1 , K 2 ∈ Λ n are considered different provided there is a facet of K 1 with vertices with certain labels but there is no facet of K 2 with the same set of labels. For example, Figure 4(a) shows all pairwise different vertex labelings of a 4-vertex path of length 3 with labels 1, 2, 3, 4.
Let Γ = Aut(K d ) be the automorphism group of the ambient simplicial complex K d with n vertices. Thus, Γ is a subgroup of the symmetric group S n (that is, the group which consists of all n! permutations of the n-element set {1, 2, . . . , n}) and acts (left) on the set Λ n : Under this group action, the effect of γ (γ ∈ Γ) on K (K ∈ Λ n ) is the new vertex labeling of K , denoted by γ · K , which is obtained from the original one by simply replacing each vertex label u of K with label γ(u), that is, the label of the image of the vertex u, under the permutation γ, in K .
Let K be an element of Λ n . The orbit of K is the set {γ ·K | γ ∈ Γ} of elements in Λ n to which K can be moved by the elements of Γ. This action decomposes the set Λ n into a number of disjoint orbits. The stabilizer subgroup of K is defined to be {γ ∈ Γ | γ · K = K }. It is clear that under the action of Γ on Λ n the following three claims hold for any K ∈ Λ n . Claim A: The stabilizer subgroup of K is identical with the automorphism group Aut(K). Claim B: The size of the orbit of K is equal to the number of different vertex labelings of K . Claim C: The total number of orbits is equal to |Ω n |.
Let Λ n k denote the subset of Λ n whose elements are k-symmetric (as unlabeled simplicial complexes, that is, with the labels removed). Note that by Lagrange's theorem, k is necessarily a divisor of |Γ|. Let K ∈ Λ n k . By the Orbit-Stabilizer Theorem [10], the size of the orbit of K is equal to the index |Γ|/k of the stabilizer subgroup of K in the group Γ. By Claim C, summing over the |Ω n k | different orbits of k-symmetric elements in Λ n k gives the following equation: Summing Eqs. (1) over k gives the following equation: Thus, we come to the orbit decomposition formula [10] for the action of the group Γ on the set Λ n : where Aut(K i ) stands for the automorphism group of any representative element K i in orbit i. When it is clear what value n is meant to be, the notations Ω n k and Λ n k may be abbreviated to Ω k and Λ k , respectively.

A new enumerative polynomial
For a given set Ω (= Ω n ), we introduce a new enumerative polynomial, which is defined by This enumerative polynomial has derivative and integral which are combinatorially meaningful.
(II) Evaluate the derivative: Therefore, where α is the total number of automorphisms,ᾱ is the total number of trivial automorphisms, andα is the total number of nontrivial automorphisms when counted across all elements of Ω.

Examples: Trees
The role of this section is to demonstrate the enumerative polynomial in a simple framework of ordinary trees, that is, connected graphs without cycles, with a given number of vertices. Specifically for trees with n (n 4) vertices, the ambient simplicial complex K 1 is the complete graph K n , the acting group Γ is the symmetric group S n , and the enumerative polynomial is given by  Figure 3 shows two non-isomorphic 4-vertex trees, T 1 (left) and T 2 (right). It is known [15, Appendix 3, p. 233] that Ω 4 = {T 1 , T 2 }. The automorphism groups of T 1 and T 2 are the symmetric groups S 2 and S 3 having orders 2 and 6, respectively. Thus,

Trees with 4 vertices
Thus, by Theorem 1:    2), the more automorphisms a tree has the fewer copies of that tree there are in the ambient graph.
The automorphism groups of T 1 , T 2 , T 3 are the symmetric groups S 2 , S 2 , S 4 having orders 2, 2, 24, respectively. Thus, Thus, by Theorem 1:  On the practical side, trees provide models for saturated acyclic hydrocarbons [16,Chapter 8,p. 533]. The number of different chemical isomers sharing the same chemical formula C n H 2n+2 is equal to the number of pairwise non-isomorphic trees with n vertices. For n = 5, all pairwise non-isomorphic trees with 5 vertices are shown on Figure 5, and the corresponding isomers with the formula C 5 H 12 are listed in Figure 6: pentane, isopentane, neopentane (from left to right).
In conclusion of this section, we mention Bernstein's theorem [17] restricted to the real axis, which states: |M (1)| deg M(x) · |M(1)| for any polynomial M(x). It is tempting to apply this inequality to the enumerative polynomial P n (x) along with its derivative and integral, but it only produces simple corollaries. For instance, apply Bernstein's theorem to the polynomial M(x) = x 0 P n (t)dt in the set Ω n of pairwise non-isomorphic trees on n unlabeled vertices (n 4). Since it can be easily seen that the largest order of the automorphism group of an n-vertex tree is (n − 1)!, it follows that deg M(x) (n − 1)! and, by Bernstein's theorem, |M (1)| = P n (1) (n−1)! 1 0 P n (x)dx. Thus, by Theorem 1 (I), (III), we come to the following inequality: |Ω n | |Λ n |/n. Now, applying Cayley's tree formula, |Λ n | = n n−2 , we come to the following upper bound on the number of trees with n unlabeled vertices: |Ω n | n n−3 .
5 Symmetry properties of the graph G = K 2,2,2,2 and its triangular embeddings in the torus We refer the interested reader to White's textbook [18] for the basics of topological graph theory, including automorphism groups of graphs and Cayley graphs. Throughout this paper, T (G) stands for the triangulation of the torus shown in Figure 2 (left) and G (= K 2,2,2,2 ) stands for its graph, as specified in the Introduction. It is known [11,12] that the triangulation T (G) is a unique (up to isomorphism) triangulation of the torus whose graph is isomorphic to K 2,2,2,2 , whence all embeddings of G in the torus are isomorphic as triangulations. Thus, the set Ω = Ω 8 of all non-isomorphic 8-vertex unlabeled triangulations of the torus, with the graph G, consists of a single element: The automorphism group Aut(G) of the graph G is identical with the automorphism group of its complementary graph Aut(G) ≡ Aut(4K 2 ), which is identical with the composition (or wreath product) S 4 [Aut(K 2 )] = S 4 [S 2 ] and has order |S 4 | · |S 2 | 4 = 4! · (2!) 4 = 384; see [18,Chapter 3] for details.
Let the group Γ = Aut(G) act (left) on the set Λ = Λ 8 of triangulations of the torus with the 8-vertex-labeled graph G; under this action, the effect of an automorphism γ ∈ Aut(G) on T (G)replaces each vertex label u in T (G) with γ(u). (Geometrically, the ambient simplicial complex K 2 may be thought of as the 2-skeleton of the 16-cell in R 4 as discussed at the end of the Introduction.) Since Ω = {T (G)}, all triangulations of the torus with the vertex-labeled graph G are in a single orbit under the action of Γ = Aut(G) on Λ. The automorphism group Aut(T (G)) of the triangulation T (G) is determined in [14,13]. This group can be generated by the involutions τ 1 = (3 5)(4 7) and τ 2 = (1 6)(3 7)(4 5) together with the cyclic shift τ 3 = (1 5 2 7 6 3 8 4) (check with Figure 2, left). Thus, |Aut(T (G))| = 2 · 2 · 8 = 32, whence |Ω| = |Ω 8 32 | = 1. Summarizing, the enumerative polynomial defined by Eq. (3) for the set Ω = {T (G)} can be written down as follows: Thus, by Theorem 1 (III), whence the number of triangulations of the torus with the vertex-labeled graph G is equal to 12: Figure 7. The Cayley graph G of Q 8 .
The quaternion group Q 8 is a non-abelian group of order 8, isomorphic to the 8element subset {1, i, j, k, −1, −i, −j, −k} of the quaternions under multiplication. The crucial idea is to convert the graph G (Figure 2, left) into the Cayley graph of the quaternion group Q 8 by first replacing the labels 1, 2, 3, 4, 5, 6, 7, 8 with the quaternions 1, −i, k, j, −k, −1, −j, i (respectively) and then assigning colors and directions to the edges as shown in Figure 7. This conversion will enable us to classify the 12 different triangulations (in Section 6), which number is stated by Eq. (4), in a systematic way by a combination of algebraic and symmetry techniques. The red [respectively, green, blue] directed edges correspond to the multiplication by i (on the right) [respectively, by j, k]. The Cayley graph provides the multiplication table of Q 8 as a picture in Figure 7; for example, the blue edge directed from j to i in Figure 7 provides the equality j · k = i.
It should be noted that the Cayley graph, in fact, depends on the choice of the group generators, and what is often called the Cayley graph of Q 8 is the subgraph obtained from Figure 7 by deleting the blue edges. This subgraph corresponds to the set {i, j} chosen as a minimal generating set. Furthermore, this subgraph is known [18] to quadrangulate the torus, and it can be thought that the quadrilaterals are dissected into triangles by the blue edges as in Figure 7; the resulting graph triangulates the torus and is called the (extended) Cayley graph of the quaternion group Q 8 throughout this paper.
We finally make a useful observation. The edge set of the graph G forms a single orbit under the natural action of the group Γ ≡ Aut(G); however, there are two orbits under the action of Aut(T (G)) (as a subgroup of Γ). In the latter instance, one orbit has 8 edges and the other one has 16 edges, where the orbit of size 8 coincides with the edge set of the union of two disjoint red cycles (with the directions removed) of length 4 (Figure 7). This can be proved by straightforward inspection of the three generators of Aut(T (G)) as follows: The generator τ 1 = ( j −j)(k −k) preserves each of the three colors, while the generators τ 2 = (1 −1)( j −k)(k −j) and τ 3 = (− k −i −j −1 k i j 1) preserve the red color, changing green into blue and blue into green (check with Figure 7). Therefore, the representation of the graph G as a triangulation T (G) of the torus (Figure 2, left) has an advantage before the graph G only as itself: The combinatorial structure of the triangulation T (G) alone distinguishes the edges that are colored red in Figure 7. (Observe from Figure 7 that the two red cycles are both geodetic and homotopic to each other in the torus; a geodetic cycle C in a graph H is a cycle with the property that for every two vertices u, v ∈ C at least one of the paths uC v or vC u is a geodesic in H.) 6 Systematic generation of triangulations of the torus with the vertex-labeled graph G = K 2,2,2,2 As we already know by Eq. (4), there exist precisely 12 triangular embeddings of the vertex-labeled graph G = K 2,2,2,2 in the torus. Explicit identification of the 12 triangulations was done in [14] by a direct exhaustive computer search. In this section it is shown how to generate the 12 triangulations intelligently without using computing technology. We will use the representation of G in Figure 7 instead of the representation in Figure 2 (left). It should be noted that we regard the Cayley graph in Figure 7 as just replacing the alphabet for labeling the vertices of the original vertex-labeled simple graph G in Figure 2 (left); we will use the same notation for both graphs. The edge colors and directions in Figure 7 will only help us to reveal the structure of the set Λ.
Consider the following four permutations of the vertex set of the graph G in Figure 7 (leaving the rest of the vertices fixed): It is not hard to verify with Figure 7 that each of the four permutations is an automorphism of the graph G but not each of them is an automorphism of the triangulation T (G): While the identity permutation "id" is of course an automorphism of T (G), none of γ rot , γ ref , or γ rot γ ref is an automorphism of T (G). The notation is inspired by the observation that the graph automorphism γ rot is realized geometrically as a rotation of the square with vertices 1, i, −1, −i while the graph automorphisms   For γ ∈ Γ = Aut(G), let γ · T (G) denote the triangulation which is the effect of the permutation γ on T (G) under the action of the group Γ on the set Λ of triangulations of the torus with the vertex-labeled graph G. It is not hard to verify with Figure 7 that the four triangulations T (G), γ rot · T (G), γ ref · T (G), and γ rot γ ref · T (G) (all shown in Figure 8(b)) are pairwise different. Moreover, the pair of triangulations in each row of Figure 8 Figure 8(a) in the form of a geometric realization. Furthermore, fixing the other four vertices of G (that is, j, −j, k, and −k), we regard D 8 as a subgroup of Γ = Aut(G) acting on the set Λ. It is not hard to verify that the elements of D 8 (graph automorphisms) seen in one frame of Figure 8(a) produce an identical effect on T (G) under the action of D 8 on Λ, that is, both graph automorphisms move T (G) to the same triangulation.
The center of the group and is illustrated in Figure 8 Consider the automorphism (i j)(−i −j) of the graph G. This graph automorphism moves the triangulation T (G) to the triangulation (i j)(−i −j) · T (G), shown in the left-hand side of the upper row of Figure 9, taking the (red) cycle (1, i, −1, −i) onto the (green) cycle (1, j, −1, − j) (check with Figure 7). We process the triangulation (i j)(−i −j) · T (G) in the same way as we did with the triangulation T (G) in the proof of Lemma 1, swapping i and j, −i and − j, and switching from the red to the green color. This leads to Series 2 of four pairwise different toroidal triangulations, shown in Figure 9. Each of them is obtained as effect of the graph automorphism (i j)(−i −j) on the corresponding triangulation of Figure 8 Theorem 2. There are precisely twelve triangulations of the torus with the vertexlabeled graph G = K 2,2,2,2 , presented in Figures 8(b), 9, and 10, all isomorphic but pairwise different as vertex-labeled triangulations. They are obtained from the three triangulations, T (G) (Figure 7 Proof. Observe that Figure 9 [respectively, Figure 10] is obtained from Figure 8(b) by swapping i and j, −i and −j [respectively, i and k, −i and −k] in each of the four diagrams, and switching from the red to the green [respectively, blue] color. Thus, analogs of Lemma 1 still hold for the dihedral groups D 8 = D 8 (1, j, −1, −j) and D 8 (1, k, −1, −k). Thus, the four triangulations in Figure 9 [respectively, Figure  10] are pairwise different as well as the four triangulations in Figure 8 Remark 1. It is not hard to verify that the cycle C 5 is the only, up to isomorphism, self-complementary graph (that is, a graph which is isomorphic to its complement) homeomorphic to the 1-torus (that is, a circle); see Figure 1. In this specific case we have: K 1 = K 5 (the complete graph with 5 vertices), Γ ≡ Aut(K 5 ) ≡ S 5 , Aut(C 5 ) ≡ D 10 , P(x) = x 9 , 1 0 P(x)dx = 1/10. Thus, by Theorem 1 (III), 1/10 = |Λ|/|S 5 |, whence |Λ| = 5!/10 = 12 is the number of different vertex labelings of C 5 . It is not hard to verify that those 12 different labeled graphs split into six pairs of cycles which are the complementarities of each other in each pair (see an example in Figure 1). Therefore, there exist exactly six pairs of mutually complementary simplicial 1-complexes homeomorphic to the 1-torus, which have a cycle of length 5 as underlying simplicial 1-complex. Analogously, T (G) in Figure 2 (left) is the only, up to isomorphism, self-complementary simplicial 2-complex (that is, a simplicial 2-complex which is isomorphic to its complement) homeomorphic to the 2-torus [19]. Finally, as an intriguing coincidence, there are exactly 6 pairs of mutually complementary simplicial 2-complexes homeomorphic to the 2-torus, which have as underlying simplicial 2-complex the triangulation T (G).

Conclusive remarks
Our approach to studying the 8-vertex triangulation T (G) of the torus with the graph G = K 2,2,2,2 ( Figure 2, left) can be briefly summarized as follows. The graph G with the labels removed is known to embed in the torus uniquely up to isomorphism, producing the triangulation T (G). Using symmetry properties of G and T (G), Theorem 1 (III) enables us to calculate the number, 12, of pairwise different (triangular) embeddings of the vertex-labeled graph G in the torus. Furthermore, the algebraic approach proposed in this paper enables us to generate the 12 embeddings explicitly in the form of graphics (Figures 8(b), 9,10), for the first time without computer assistance. For this, we think of the graph G as the (extended) Cayley graph G of the quaternion group Q 8 ( Figure 7) and observe that the dihedral group D 8 /Z(D 8 ) of the automorphisms of the cycle (1, i, −1, −i) (with the directions removed) factored by its center, acting on the set Λ, moves T (G) to some 4 pairwise different triangulations, including T (G) itself (Figure 8(b)). We also observe that the same construction applies to the triangulations (i j)(−i −j) · T (G) and (i k)(−i −k) · T (G) in place of T (G) (Figures 9, 10). Totally, we obtain 4 · 3 = 12 pairwise different triangulations of the torus with the vertex-labeled graph G. Figure 11. Impossible situation in a Grünbaum colored triangulation.
As far as graph coloring topics go, we observe first that the operation of converting the graph G = K 2,2,2,2 into the Cayley graph of Q 8 (Figure 7) makes the graph Grünbaum colored (see a review [1]), which means that the edges of the graph are 3-colored so that each face of the triangulation T (G) has all the three colors in its boundary edges. Moreover, observe that any cycle of G (Figure 7) with length 3 has all the 3 colors in its edges, and thus any triangulation with the graph G is Grünbaum colored. Observe that Grünbaum coloring entails that edges with the same color (red, for instance) are never neighboring around any vertex of the triangulation, which prevents us from algebraic meaninglessness; for example, it prevents the vertices x and x · i · i (= −x) from being adjacent in G, for any x ∈ Q 8 ; see Figure 11.
Finally, we give a geometric interpretation of Theorem 2 which will be useful in the future research. In fact, the 12 toroidal vertex-labeled triangulations, stated in Theorem 2, are realized geometrically as noble toroidal 2-dimensional polyhedra in the 2-skeleton of the 16-cell in R 4 ; see [13,2]; their difference as vertex-labeled toroidal triangulations ensures that the corresponding 12 polyhedra are different as point-sets in R 4 . It would be interesting to verify if the 12 polyhedra are all isometric and, if yes, find isometric transformations of R 4 which move the 12 polyhedra between themselves. Also, we plan to realize the 12 polyhedra in a Schlegel diagram of the 16-cell; this will lead to new toroidal polyhedra in R 3 (as discussed in the Introduction).