Recursive constructions for triangulations
From MaRDI portal
Recommendations
- A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs
- Face 2-colourable triangular embeddings of complete graphs
- scientific article; zbMATH DE number 2061797
- Exponential families of non-isomorphic triangulations of complete graphs
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
Cites work
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- Exponential families of non-isomorphic triangulations of complete graphs
- Face 2-colourable triangular embeddings of complete graphs
- Nonisomorphic Steiner triple systems
- ON THE CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS
- Surface embeddings of Steiner triple systems
- Three nonisomorphic triangulations of an orientable surface with the same complete graph
- Über das Problem der Nachbargebiete auf orientierbaren Flächen
Cited in
(32)- Nonorientable biembeddings of Steiner triple systems
- The number of nonisomorphic nonorientable 6-gonal embeddings of complete graphs
- Triangular embeddings of complete graphs from graceful labellings of paths
- Triangulations. Structures for algorithms and applications
- 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
- Self-embeddings of Hamming Steiner triple systems of small order and APN permutations
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
- On the number of triangular embeddings of complete graphs and complete tripartite graphs
- Recursive Triangles Appearing Embedded in Recursive Families
- Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\)
- On parity vectors of Latin squares
- 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.
- A constraint on the biembedding of Latin squares
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
- Generating nonisomorphic quadrangular embeddings of a complete graph
- Output-Sensitive Construction of the Union of Triangles
- 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
- BIEMBEDDINGS OF STEINER TRIPLE SYSTEMS IN ORIENTABLE PSEUDOSURFACES WITH ONE PINCH POINT
- Triangulations and a generalization of Bose's method
- Face 2-colourable triangular embeddings of complete graphs
- Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
- scientific article; zbMATH DE number 5587879 (Why is no real title available?)
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- 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
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
- Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs
This page was built for publication: Recursive constructions for triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4534209)
