On the toroidal thickness of graphs
Ian Muir Anderson · Journal of Graph Theory · 1982
Abstract The toroidal thickness t1(G) of a graph G is the minimum value of k such that G is the union of k graphs each of which is embeddable on a torus. We find t1(Gm), where Gm is the graph obtained from the complete graph Km by removing a Hamiltonian cycle, and we show that t1(Kn(3)) = [1/2n] for many values of n. The method of approach involves the construction of sets of triples related to Skolem triples.