Pages that link to "Item:Q4534209"
From MaRDI portal
The following pages link to Recursive constructions for triangulations (Q4534209):
Displayed 10 items.
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs (Q598471) (← links)
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs (Q933668) (← links)
- A constraint on the biembedding of Latin squares (Q1003587) (← links)
- On the bi-embeddability of certain Steiner triple systems of order 15 (Q1864565) (← links)
- Nonorientable biembeddings of Steiner triple systems (Q1877654) (← links)
- Triangular embeddings of complete graphs from graceful labellings of paths (Q2384805) (← links)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\) (Q2469982) (← links)
- A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs (Q2469983) (← links)
- Triangulations of orientable surfaces by complete tripartite graphs (Q2488935) (← links)
- On the maximal distance between triangular embeddings of a complete graph. (Q2490841) (← links)