An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus

DOI10.1016/0012-365X(87)90105-1zbMath0618.05019MaRDI QIDQ1088996

S. A. Lavrenchenko

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

triangulationtorusuniquely embeddable graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Unnamed Item ⋮ Minimum genus embeddings of the complete graph ⋮ \(K_{6}\)-minors in triangulations on the nonorientable surface of genus 3 ⋮ Shortest path embeddings of graphs on surfaces ⋮ Embeddings of graphs with no short noncontractible cycles ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ A theorem on graph embedding with a relation to hyperbolic volume ⋮ K₆-minors in triangulations and complete quadrangulations ⋮ Number of triangular packings of a marked graph on a projective plane ⋮ Exponentially many maximum genus embeddings and genus embeddings for complete graphs ⋮ Even Embeddings of the Complete Graphs and Their Cycle Parities

Cites Work

• Uniqueness and faithfulness of embedding of toroidal graphs