Dihedral biembeddings and triangulations by complete and complete tripartite graphs

DOI10.1007/S00373-012-1163-1zbMATH Open1268.05031OpenAlexW1987602560MaRDI QIDQ354470FDOQ354470

Authors: Martin Knor, Michael John Grannell 

Publication date: 19 July 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1163-1

Recommendations

• On biembeddings of Latin squares
• Triangulations of orientable surfaces by complete tripartite graphs
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• A construction for biembeddings of Latin squares
• Biembeddings of Latin squares of side 8

zbMATH Keywords

embeddingdihedral groupbiembeddings of Latin squaresCayley tablescomplete tripartite graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Three nonisomorphic triangulations of an orientable surface with the same complete graph
• Exponential families of non-isomorphic triangulations of complete graphs
• On the number of nonisomorphic orientable regular embeddings of complete graphs
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
• Twofold triple systems and graph imbeddings
• Nonorientable biembeddings of Steiner triple systems
• On biembeddings of Latin squares
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
• Triangulations of orientable surfaces by complete tripartite graphs
• Biembeddings of Abelian groups
• Title not available (Why is that?)
• Recursive constructions for triangulations
• BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
• Title not available (Why is that?)
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
• A lower bound for the number of orientable triangular embeddings of some complete graphs

Cited In (8)

• A note on the directed genus of K_n,n,n and K_n
• On biembeddings of Latin squares
• Triangulations of orientable surfaces by complete tripartite graphs
• Biembeddings of Abelian groups
• Biembeddings of metacyclic groups and triangulations of orientable surfaces by complete graphs
• Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs
• A simple proof of the map color theorem for nonorientable surfaces
• Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs

This page was built for publication: Dihedral biembeddings and triangulations by complete and complete tripartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354470)