Pages that link to "Item:Q965249"
From MaRDI portal
The following pages link to A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249):
Displayed 9 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)
- Biembeddings of 2-rotational Steiner triple systems (Q2344825) (← links)
- Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs (Q2515556) (← 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)
- Self-embeddings of cyclic and projective Steiner quasigroups (Q3072530) (← links)