An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus (Q1088996): Difference between revisions

A graph G of a triangulation of the torus \(S_ 1\) is said to be uniquely embeddable in \(S_ 1\) if all embeddings of G in \(S_ 1\) are isomorphic as triangulation. \textit{S. Negami} [ibid. 44, 161-180 (1983; Zbl 0508.05033)] constructed examples of 3-, 4-and 5-connected triangulations of \(S_ 1\) whose graphs are not uniquely embeddable in \(S_ 1\); in the first two cases he gave infinitely many such examples. In the present paper the author constructs an infinite family of 5-connected triangulations of \(S_ 1\) which are non-uniquely embeddable in \(S_ 1\) as graphs.