Pages that link to "Item:Q965249"

The following pages link to A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249):

Displaying 17 items.

• 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)
• Coloring face hypergraphs on surfaces (Q703607) (← links)
• Exponentially many nonisomorphic genus embeddings of \(K_{n,m}\) (Q710593) (← links)
• Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs (Q898131) (← links)
• Face 2-colourable triangular embeddings of complete graphs (Q1272468) (← links)
• Quadrangular embeddings of complete graphs and the even map color theorem (Q2338632) (← links)
• Biembeddings of 2-rotational Steiner triple systems (Q2344825) (← 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)
• Self-embeddings of cyclic and projective Steiner quasigroups (Q3072530) (← links)
• A note on the directed genus of K_n,n,n and K_n (Q4577874) (← links)
• A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares (Q4629521) (← links)
• A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (Q5151496) (← links)
• On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs (Q6619397) (← links)