Pages that link to "Item:Q598471"

The following pages link to Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs (Q598471):

Displaying 18 items.

• Minimum genus embeddings of the complete graph (Q335320) (← links)
• Dihedral biembeddings and triangulations by complete and complete tripartite graphs (Q354470) (← links)
• Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) (Q710593) (← links)
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs (Q933668) (← links)
• A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249) (← links)
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) (Q1011722) (← links)
• Biembeddings of 2-rotational Steiner triple systems (Q2344825) (← 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)
• On the maximal distance between triangular embeddings of a complete graph. (Q2490841) (← 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)
• Even Embeddings of the Complete Graphs and Their Cycle Parities (Q5272641) (← links)