Pages that link to "Item:Q1042786"
From MaRDI portal
The following pages link to Exponentially many maximum genus embeddings and genus embeddings for complete graphs (Q1042786):
Displaying 8 items.
- Minimum genus embeddings of the complete graph (Q335320) (← links)
- Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs (Q598471) (← links)
- Genus embeddings of a type of graph (Q949340) (← links)
- Upper embeddability, edge independence number and girth (Q1044280) (← links)
- On the number of maximum genus embeddings of almost all graphs (Q1193548) (← links)
- Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. (Q1850631) (← links)
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\) (Q2355353) (← links)
- On the number of genus embeddings of complete bipartite graphs (Q2637736) (← links)