论文信息 - BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS

BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS

Face 2-colourable triangulations of complete tripartite graphs $K_{n,n,n}$ correspond to biembeddings of Latin squares. Up to isomorphism, we give all such embeddings for $n=3,4,5$ and 6, and we summarize the corresponding results for $n=7$. Closely related to these are Hamiltonian decompositions of complete bipartite directed graphs $K^*_{n,n}$, and we also give computational results for these in the cases $n=3,4,5$ and 6.

Mike J. Grannell | Terry S. Griggs | M. Knor

[1] Vladimir P. Korzhik,et al. Nonorientable biembeddings of Steiner triple systems , 2004, Discret. Math..

[2] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[3] Mike J. Grannell,et al. Triangulations of orientable surfaces by complete tripartite graphs , 2006, Discret. Math..

[4] Dan Archdeacon,et al. Topological Graph Theory - A Survey , 1996 .

[5] Mike J. Grannell,et al. Exponential Families of Non-Isomorphic Triangulations of Complete Graphs , 2000, J. Comb. Theory, Ser. B.

[6] Mike J. Grannell,et al. Face 2-Colourable Triangular Embeddings of Complete Graphs , 1998, J. Comb. Theory, Ser. B.

[7] Mike J. Grannell,et al. Surface embeddings of Steiner triple systems , 1998 .

[8] G. Ringel. Map Color Theorem , 1974 .

[9] Mike J. Grannell,et al. Recursive constructions for triangulations , 2002, J. Graph Theory.

[10] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.

[11] Saul Stahl,et al. Genus embeddings for some complete tripartite graphs , 1976, Discret. Math..

[12] References , 1971 .

[13] Mike J. Grannell,et al. Recursive constructions for triangulations , 2002 .

[14] J. Gross,et al. Graph Theory and Its Applications , 1998 .