Exponential families of non-isomorphic triangulations of complete graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
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
Block designs and graph imbeddings

Cited In (44)

Nonorientable biembeddings of Steiner triple systems
Triangular embeddings of complete graphs from graceful labellings of paths
Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
Doubly even orientable closed 2-cell embeddings of the complete graph
Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
On the bi-embeddability of certain Steiner triple systems of order 15
Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
Triangulations of orientable surfaces by complete tripartite graphs
On the number of triangular embeddings of complete graphs and complete tripartite graphs
Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
Coloring face-hypergraphs of graphs on surfaces
On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs
On the maximal distance between triangular embeddings of a complete graph.
Recursive constructions for triangulations
Embedding digraphs on orientable surfaces
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
Another proof of the map color theorem for nonorientable surfaces.
Minimum genus embeddings of the complete graph
Quadrangular embeddings of complete graphs and the even map color theorem
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
Generating nonisomorphic quadrangular embeddings of a complete graph
Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences
A simple proof of the map color theorem for nonorientable surfaces
Dihedral biembeddings and triangulations by complete and complete tripartite graphs
Exponentially many maximum genus embeddings and genus embeddings for complete graphs
Face 2-colourable triangular embeddings of complete graphs
Tilings of nonorientable surfaces by Steiner triple systems
Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
Face distributions of embeddings of complete graphs
A new approach to constructing exponentially many nonisomorphic nonorientable triangular 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}\)
Bi-embeddings of the projective space PG(3, 2)
Nonisomorphic complete triangulations of a surface
Oriented matroids and complete-graph embeddings on surfaces
Settling the genus of the \(n\)-prism
Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
On the number of nonisomorphic orientable regular embeddings of complete graphs
Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s
Maximum genus embeddings of Steiner triple systems
Flexibility of polyhedral embeddings of graphs in surfaces
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments

   Recommendations

This page was built for publication: Exponential families of non-isomorphic triangulations of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569080)