On the number of triangular embeddings of complete graphs and complete tripartite graphs
M. J. Grannell, Martin Knor · Journal of Graph Theory · 2011
Abstract We prove that for every prime numberpand oddm>1, ass→∞, there are at leastw face 2‐colorable triangular embeddings ofKw, w, w, wherew=m·ps. For both orientable and nonorientable embeddings, this result implies that for infinitely many infinite families ofz, there is a constantc>0 for which there are at leastz nonisomorphic face 2‐colorable triangular embeddings ofKz. © 2011 Wiley Periodicals, Inc. J Graph Theory