Pages that link to "Item:Q1343277"

The following pages link to Three nonisomorphic triangulations of an orientable surface with the same complete graph (Q1343277):

Displaying 17 items.

• Minimum genus embeddings of the complete graph (Q335320) (← links)
• Dihedral biembeddings and triangulations by complete and complete tripartite graphs (Q354470) (← links)
• Some triangulated surfaces without balanced splitting (Q503625) (← links)
• Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness (Q932590) (← links)
• A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs (Q933668) (← links)
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs (Q1042786) (← links)
• Face 2-colourable triangular embeddings of complete graphs (Q1272468) (← links)
• Diagonal flips in triangulations on closed surfaces with minimum degree at least 4 (Q1305524) (← links)
• Exponential families of non-isomorphic triangulations of complete graphs (Q1569080) (← links)
• On the number of nonisomorphic orientable regular embeddings of complete graphs (Q1850510) (← links)
• Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
• Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. (Q1850631) (← links)
• Quadrangular embeddings of complete graphs and the even map color theorem (Q2338632) (← 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)
• Recursive constructions for triangulations (Q4534209) (← links)
• Face distributions of embeddings of complete graphs (Q6055941) (← links)