Exponential families of non-isomorphic triangulations of complete graphs
From MaRDI portal
Publication:1569080
DOI10.1006/jctb.1999.1939zbMath1023.05041OpenAlexW2034485257MaRDI QIDQ1569080
C. Paul Bonnington, Terry S. Griggs, Michael John Grannell, Jozef Širáň
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1999.1939
Related Items (39)
Nonorientable biembeddings of Steiner triple systems ⋮ On the number of triangular embeddings of complete graphs and complete tripartite graphs ⋮ Recursive constructions for triangulations ⋮ Triangular embeddings of complete graphs from graceful labellings of paths ⋮ Minimum genus embeddings of the complete graph ⋮ Oriented matroids and complete-graph embeddings on surfaces ⋮ Dihedral biembeddings and triangulations by complete and complete tripartite graphs ⋮ Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs ⋮ A simple proof of the map color theorem for nonorientable surfaces ⋮ Face distributions of embeddings of complete graphs ⋮ Doubly even orientable closed 2-cell embeddings of the complete graph ⋮ Another proof of the map color theorem for nonorientable surfaces. ⋮ Settling the genus of the \(n\)-prism ⋮ Tilings of nonorientable surfaces by Steiner triple systems ⋮ Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs ⋮ A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs ⋮ A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s ⋮ Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\) ⋮ A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs ⋮ A lower bound for the number of orientable triangular embeddings of some complete graphs ⋮ Triangulations of orientable surfaces by complete tripartite graphs ⋮ Maximum genus embeddings of Steiner triple systems ⋮ On the maximal distance between triangular embeddings of a complete graph. ⋮ Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) ⋮ Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs ⋮ Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) ⋮ Bi-embeddings of the projective space PG(3, 2) ⋮ Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments ⋮ Exponentially many maximum genus embeddings and genus embeddings for complete graphs ⋮ Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph ⋮ Quadrangular embeddings of complete graphs and the even map color theorem ⋮ On the number of nonisomorphic orientable regular embeddings of complete graphs ⋮ Flexibility of polyhedral embeddings of graphs in surfaces ⋮ Embedding digraphs on orientable surfaces ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. ⋮ Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences ⋮ On the bi-embeddability of certain Steiner triple systems of order 15 ⋮ Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
Cites Work
- Unnamed Item
- Unnamed Item
- Block designs and graph imbeddings
- Face 2-colourable triangular embeddings of complete graphs
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- On the number of nonisomorphic orientable regular embeddings of complete graphs
- Nonisomorphic Steiner triple systems
- Surface embeddings of Steiner triple systems
This page was built for publication: Exponential families of non-isomorphic triangulations of complete graphs
