A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
From MaRDI portal
Publication:933668
DOI10.1016/j.jctb.2007.10.002zbMath1148.05027OpenAlexW1996246805MaRDI QIDQ933668
Terry S. Griggs, Michael John Grannell
Publication date: 24 July 2008
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.2007.10.002
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items (17)
On the number of triangular embeddings of complete graphs and complete tripartite graphs ⋮ Biembedding Abelian groups with mates having transversals ⋮ Dihedral biembeddings and triangulations by complete and complete tripartite graphs ⋮ 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 ⋮ Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs I: Latin Square Constructions ⋮ A lower bound for the number of orientable triangular embeddings of some complete graphs ⋮ 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 ⋮ Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences ⋮ Biembeddings of 2-rotational Steiner triple systems
Cites Work
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Twofold triple systems and graph imbeddings
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- 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
- Recursive constructions for triangulations
- BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
