Pages that link to "Item:Q2891048"
From MaRDI portal
The following pages link to On the number of triangular embeddings of complete graphs and complete tripartite graphs (Q2891048):
Displaying 14 items.
- Some triangulated surfaces without balanced splitting (Q503625) (← links)
- The variety of triangular embeddings of a graph in the projective plane (Q757397) (← links)
- Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs (Q898131) (← 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)
- On the number of acute triangles in a straight-line embedding of a maximal planar graph (Q1306427) (← links)
- A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices (Q1727793) (← 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)
- A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (Q5151496) (← links)
- On the Number of Triangles Contained in Certain Graphs (Q5733172) (← links)
- On the number of non-isomorphic (simple) \(k\)-gonal biembeddings of complete multipartite graphs (Q6619397) (← links)
