Learn More
A cyclic construction is presented for building embeddings of the complete tripartite graph K n,n,n on a nonorientable surface such that the boundary of every face is a hamilton cycle. This construction works for several families of values of n, and we extend the result to all n with some methods of Bouchet and others. The nonorientable genus of K t,n,n,n ,(More)
In an earlier paper the authors constructed a hamilton cycle embedding of Kn,n,n in a nonori-entable surface for all n ≥ 1 and then used these embeddings to determine the genus of some large families of graphs. In this two-part series, we extend those results to orientable surfaces for all n = 2. In part II, a voltage graph construction is presented for(More)
  • 1