Pages that link to "Item:Q1850510"

The following pages link to On the number of nonisomorphic orientable regular embeddings of complete graphs (Q1850510):

Displaying 36 items.

• Minimum genus embeddings of the complete graph (Q335320) (← links)
• 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)
• Some triangulated surfaces without balanced splitting (Q503625) (← links)
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs (Q598471) (← links)
• Graceful labelling: state of the art, applications and future directions (Q691624) (← links)
• Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) (Q710593) (← links)
• Oriented matroids and complete-graph embeddings on surfaces (Q857411) (← 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)
• Vertex transitive embeddings of complete graphs (Q1003847) (← 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)
• Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs (Q1043639) (← links)
• Another proof of the map color theorem for nonorientable surfaces. (Q1403919) (← links)
• Exponential families of non-isomorphic triangulations of complete graphs (Q1569080) (← links)
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. (Q1850631) (← links)
• The edge-regular complete maps (Q2053559) (← links)
• Minimal quadrangulations of surfaces (Q2171020) (← links)
• Quadrangular embeddings of complete graphs and the even map color theorem (Q2338632) (← 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)
• Cayley maps (Q2573643) (← links)
• On the number of genus embeddings of complete bipartite graphs (Q2637736) (← 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)
• Cyclic bi‐embeddings of Steiner triple systems on 12s + 7 points (Q4534380) (← links)
• Edge-transitive embeddings of complete graphs (Q5041810) (← links)
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (Q5151496) (← links)
• Even Embeddings of the Complete Graphs and Their Cycle Parities (Q5272641) (← links)
• Face distributions of embeddings of complete graphs (Q6055941) (← links)