Pages that link to "Item:Q2469983"
From MaRDI portal
The following pages link to A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs (Q2469983):
Displaying 17 items.
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs (Q598471) (← links)
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs (Q898131) (← links)
- Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness (Q932590) (← links)
- A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249) (← links)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) (Q1011722) (← links)
- Face 2-colourable triangular embeddings of complete graphs (Q1272468) (← links)
- Exponential families of non-isomorphic triangulations of complete graphs (Q1569080) (← links)
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices (Q1727793) (← links)
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. (Q1850631) (← links)
- Nonorientable biembeddings of Steiner triple systems (Q1877654) (← links)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\) (Q2469982) (← links)
- On the maximal distance between triangular embeddings of a complete graph. (Q2490841) (← links)
- Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs (Q2515556) (← links)
- On the number of triangular embeddings of complete graphs and complete tripartite graphs (Q2891048) (← links)
- Recursive constructions for triangulations (Q4534209) (← links)
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (Q5151496) (← links)
- Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices (Q5318251) (← links)
