Add to ORKGAn existing construction for face 2-colourable triangular embeddings of complete regular tripartite graphs is extended and then re-examined from the viewpoint of the underlying Latin squares. We prove that this generalization gives embeddings which are not isomorphic to any of those produced by the original construction
For each integer $n\ge 3$, $n\ne 4$, for each odd integer $m\ge 3$, and for any $\lambda\in \mathbb{...
AbstractAn incomplete double diagonal Latin square of order n can be double-diagonally embedded in a...
AbstractWe give a necessary condition for the biembedding of two Latin squares in an orientable surf...
A known construction for face 2-colourable triangular embeddings of complete regular tripartite grap...
This is a preprint of an article accepted for publication in The Glasgow Math-ematical Journal c©200...
Face 2-colourable triangular embeddings of complete tripartite graphs $K_{n,n,n}$ correspond to biem...
For each positive integer n >= 2, there is a well-known regular orientable Hamiltonian embedding of ...
We construct biembeddings of some Latin squares which are Cayley tables of dihedral groups. These fa...
AbstractOrientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biemb...
Face 2-colourable triangulations of complete tripartite graphs $K_{n,n,n}$ correspond to biembedding...
Orientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biembeddings ...
A certain recursive construction for biembeddings of Latin squares has played a substantial role in ...
AbstractA face 2-colourable triangulation of an orientable surface by a complete graphKnexists if an...
We give a necessary condition for the biembedding of two Latin squares in an orientable surface. As ...
We prove that for every prime number $p$ and odd $m>1$, as $s\to\infty$, there are at least $w^{w^2\...
For each integer $n\ge 3$, $n\ne 4$, for each odd integer $m\ge 3$, and for any $\lambda\in \mathbb{...
AbstractAn incomplete double diagonal Latin square of order n can be double-diagonally embedded in a...
AbstractWe give a necessary condition for the biembedding of two Latin squares in an orientable surf...
A known construction for face 2-colourable triangular embeddings of complete regular tripartite grap...
This is a preprint of an article accepted for publication in The Glasgow Math-ematical Journal c©200...
Face 2-colourable triangular embeddings of complete tripartite graphs $K_{n,n,n}$ correspond to biem...
For each positive integer n >= 2, there is a well-known regular orientable Hamiltonian embedding of ...
We construct biembeddings of some Latin squares which are Cayley tables of dihedral groups. These fa...
AbstractOrientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biemb...
Face 2-colourable triangulations of complete tripartite graphs $K_{n,n,n}$ correspond to biembedding...
Orientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biembeddings ...
A certain recursive construction for biembeddings of Latin squares has played a substantial role in ...
AbstractA face 2-colourable triangulation of an orientable surface by a complete graphKnexists if an...
We give a necessary condition for the biembedding of two Latin squares in an orientable surface. As ...
We prove that for every prime number $p$ and odd $m>1$, as $s\to\infty$, there are at least $w^{w^2\...
For each integer $n\ge 3$, $n\ne 4$, for each odd integer $m\ge 3$, and for any $\lambda\in \mathbb{...
AbstractAn incomplete double diagonal Latin square of order n can be double-diagonally embedded in a...
AbstractWe give a necessary condition for the biembedding of two Latin squares in an orientable surf...