Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
From MaRDI portal
Publication:2469982
DOI10.1016/j.disc.2007.03.056zbMath1134.05021OpenAlexW4213030199MaRDI QIDQ2469982
Publication date: 11 February 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.056
Related Items (10)
On the number of triangular embeddings of complete graphs and complete tripartite graphs ⋮ Dihedral biembeddings and triangulations by complete and complete tripartite graphs ⋮ A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices ⋮ A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s ⋮ A lower bound for the number of orientable triangular embeddings of some complete graphs ⋮ Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) ⋮ Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) ⋮ Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph ⋮ Biembeddings of 2-rotational Steiner triple systems ⋮ Even Embeddings of the Complete Graphs and Their Cycle Parities
Cites Work
- Unnamed Item
- Unnamed Item
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Index four orientable embeddings and case zero of the Heawood conjecture
- 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.
- Recursive constructions for triangulations
- The genus of K12s
This page was built for publication: Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
