Pages that link to "Item:Q1011722"
From MaRDI portal
The following pages link to Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) (Q1011722):
Displaying 24 items.
- Dihedral biembeddings and triangulations by complete and complete tripartite graphs (Q354470) (← links)
- Doubly even orientable closed 2-cell embeddings of the complete graph (Q405100) (← links)
- Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) (Q710593) (← links)
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs (Q898131) (← links)
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs (Q933668) (← links)
- Genus embeddings of a type of graph (Q949340) (← links)
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs (Q1042786) (← links)
- Embeddings of an \(M_{12}\) geometry: Some simple combinatorial descriptions (Q1103721) (← links)
- Another proof of the map color theorem for nonorientable surfaces. (Q1403919) (← links)
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices (Q1727793) (← links)
- On the number of nonisomorphic orientable regular embeddings of complete graphs (Q1850510) (← links)
- A nonorientable triangular embedding of \(K_ n-K_ 2\), \(n\equiv 8\pmod{12}\) (Q1894771) (← links)
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\) (Q2355353) (← 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)
- Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs (Q2515556) (← links)
- A simple proof of the map color theorem for nonorientable surfaces (Q2673477) (← links)
- Generating nonisomorphic quadrangular embeddings of a complete graph (Q2853333) (← links)
- On the number of triangular embeddings of complete graphs and complete tripartite graphs (Q2891048) (← links)
- Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments (Q3652537) (← links)
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (Q5151496) (← links)
- Even Embeddings of the Complete Graphs and Their Cycle Parities (Q5272641) (← links)
- Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices (Q5318251) (← links)
