On the number of triangular embeddings of complete graphs and complete tripartite graphs
From MaRDI portal
Publication:2891048
DOI10.1002/jgt.20590zbMath1243.05168OpenAlexW1907007920MaRDI QIDQ2891048
Michael John Grannell, Martin Knor
Publication date: 13 June 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20590
Related Items (5)
A simple proof of the map color theorem for nonorientable surfaces ⋮ Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs ⋮ A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s ⋮ Some triangulated surfaces without balanced splitting ⋮ Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
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
- Regular Hamiltonian embeddings of \(K_{n,n}\) and regular triangular embeddings of \(K_{n,n,n}\).
- A lower bound for the number of orientable triangular embeddings of some complete graphs
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- 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}\)
- Biembeddings of Abelian groups
- Recursive constructions for triangulations
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
This page was built for publication: On the number of triangular embeddings of complete graphs and complete tripartite graphs
