Recursive constructions for triangulations
From MaRDI portal
Publication:4534209
DOI10.1002/jgt.10014zbMath0999.05021OpenAlexW4239288018MaRDI QIDQ4534209
Jozef Širáň, Terry S. Griggs, Michael John Grannell
Publication date: 2 December 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10014
Related Items (24)
Nonorientable biembeddings of Steiner triple systems ⋮ On the number of triangular embeddings of complete graphs and complete tripartite graphs ⋮ Triangular embeddings of complete graphs from graceful labellings of paths ⋮ Dihedral biembeddings and triangulations by complete and complete tripartite graphs ⋮ Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs ⋮ On parity vectors of Latin squares ⋮ A simple proof of the map color theorem for nonorientable surfaces ⋮ 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 ⋮ BIEMBEDDINGS OF STEINER TRIPLE SYSTEMS IN ORIENTABLE PSEUDOSURFACES WITH ONE PINCH POINT ⋮ A lower bound for the number of orientable triangular embeddings of some complete graphs ⋮ Triangulations of orientable surfaces by complete tripartite graphs ⋮ 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 ⋮ A constraint on the biembedding of Latin squares ⋮ Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) ⋮ Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs ⋮ Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph ⋮ Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences ⋮ Self-embeddings of Hamming Steiner triple systems of small order and APN permutations ⋮ On the bi-embeddability of certain Steiner triple systems of order 15
Cites Work
- Unnamed Item
- Face 2-colourable triangular embeddings of complete graphs
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- Exponential families of non-isomorphic triangulations of complete graphs
- Über das Problem der Nachbargebiete auf orientierbaren Flächen
- Nonisomorphic Steiner triple systems
- Surface embeddings of Steiner triple systems
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
This page was built for publication: Recursive constructions for triangulations
