Triangulations of orientable surfaces by complete tripartite graphs

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Orientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biembeddings of Latin squares. We show that if n is prime there are at least enlnn-n(1+o(1)) nonisomorphic biembeddings of cyclic Latin squares of order n. If n=kp, where p is a large prime number, then the number of nonisomorphic biembeddings of cyclic Latin squares of order n is at least eplnp-p(1+lnk+o(1)). Moreover, we prove that for every n there is a unique regular triangular embedding of Kn,n,n in an orientable surface. © 2006 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Grannell, M. J., Griggs, T. S., Knor, M., & Širáň, J. (2006). Triangulations of orientable surfaces by complete tripartite graphs. Discrete Mathematics, 306(6), 600–606. https://doi.org/10.1016/j.disc.2005.10.025

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free