Pages that link to "Item:Q598471"
From MaRDI portal
The following pages link to Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs (Q598471):
Displayed 7 items.
- 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)
- 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)
- On the maximal distance between triangular embeddings of a complete graph. (Q2490841) (← links)
- Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments (Q3652537) (← links)