Pages that link to "Item:Q1850631"
From MaRDI portal
The following pages link to Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. (Q1850631):
Displayed 7 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)
- Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) (Q1011722) (← links)
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs (Q1042786) (← links)
- Another proof of the map color theorem for nonorientable surfaces. (Q1403919) (← 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)