Pages that link to "Item:Q4534209"

The following pages link to Recursive constructions for triangulations (Q4534209):

Displaying 24 items.

• Dihedral biembeddings and triangulations by complete and complete tripartite graphs (Q354470) (← links)
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs (Q598471) (← links)
• On parity vectors of Latin squares (Q605004) (← 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)
• A constraint on the biembedding of Latin squares (Q1003587) (← links)
• Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) (Q1011722) (← links)
• Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs (Q1043639) (← links)
• On the bi-embeddability of certain Steiner triple systems of order 15 (Q1864565) (← links)
• Nonorientable biembeddings of Steiner triple systems (Q1877654) (← links)
• Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences (Q2342621) (← links)
• Self-embeddings of Hamming Steiner triple systems of small order and APN permutations (Q2345918) (← 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)
• Triangulations of orientable surfaces by complete tripartite graphs (Q2488935) (← 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)
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (Q5151496) (← links)
• BIEMBEDDINGS OF STEINER TRIPLE SYSTEMS IN ORIENTABLE PSEUDOSURFACES WITH ONE PINCH POINT (Q5415951) (← links)