Pages that link to "Item:Q1088996"

The following pages link to An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus (Q1088996):

Displaying 15 items.

• Minimum genus embeddings of the complete graph (Q335320) (← links)
• There is no triangulation of the torus with vertex degrees \(5, 6, \dots , 6, 7\) and related results: geometric proofs for combinatorial theorems (Q376287) (← links)
• \(K_{6}\)-minors in triangulations on the nonorientable surface of genus 3 (Q604982) (← links)
• Embeddings of graphs with no short noncontractible cycles (Q916669) (← links)
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs (Q1042786) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• Shortest path embeddings of graphs on surfaces (Q1688859) (← links)
• Number of triangular packings of a marked graph on a projective plane (Q1814064) (← links)
• On the flexibility of toroidal embeddings (Q2464151) (← links)
• Panel structures of triangulations on the torus (Q2576863) (← links)
• Face-width of embedded graphs (Q2702745) (← links)
• <i>K</i>₆-minors in triangulations and complete quadrangulations (Q3633012) (← links)
• Even Embeddings of the Complete Graphs and Their Cycle Parities (Q5272641) (← links)
• (Q5753970) (← links)
• A theorem on graph embedding with a relation to hyperbolic volume (Q5915868) (← links)