A lower bound for the number of orientable triangular embeddings of some complete graphs
From MaRDI portal
Publication:965249
DOI10.1016/j.jctb.2009.08.001zbMath1222.05106OpenAlexW2078554428MaRDI QIDQ965249
Martin Knor, Michael John Grannell
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.08.001
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
On the number of triangular embeddings of complete graphs and complete tripartite graphs, Dihedral biembeddings and triangulations by complete and complete tripartite graphs, A note on the directed genus of K_n,n,n and K_n, A simple proof of the map color theorem for nonorientable surfaces, Doubly even orientable closed 2-cell embeddings of the complete graph, Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs, A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares, A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s, Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\), Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs, Self-embeddings of cyclic and projective Steiner quasigroups, Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph, Quadrangular embeddings of complete graphs and the even map color theorem, Biembeddings of 2-rotational Steiner triple systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 constraint on the biembedding of Latin squares
- 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.
- On biembeddings of Latin squares
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- Recursive constructions for triangulations
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices
