Triangular embeddings of K((i‐2) n, n,…,n)
Brad Jackson · Journal of Graph Theory · 1980
Abstract For complete i‐partite graphs of the form K(n1, n, n, …, n) the largest value of n1 that allows the graph to be triangularly‐embedded into a surface is (i‐2)n. In this paper the author constructs triangular embeddings into surfaces of some complete partite graphs of the form K((i‐2)n, n, …, n). The embeddings are exhibited using embedding schemes but the surfaces into which K((i‐2)n, n, …, n) are triangularly embedded can be seen to be particularly nice branched covers of a surface into which K(i‐2, 1, 1,…,1) is triangularly embedded.