Dihedral biembeddings and triangulations by complete and complete tripartite graphs
From MaRDI portal
Publication:354470
DOI10.1007/s00373-012-1163-1zbMath1268.05031MaRDI QIDQ354470
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
05C10: Planar graphs; geometric and topological aspects of graph theory
05B15: Orthogonal arrays, Latin squares, Room squares
Related Items
A note on the directed genus of K_n,n,n and K_n, Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs, Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs, A simple proof of the map color theorem for nonorientable surfaces
Cites Work
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- 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
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- Twofold triple systems and graph imbeddings
- 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.
- 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
- Recursive constructions for triangulations
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item