An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus
type: Item
instance of: scholarly article
title: An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus
zbMATH Open document ID: 0618.05019
DOI: 10.1016/0012-365X(87)90105-1
published in: Discrete Mathematics
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 4002115
zbMATH Keywords: uniquely embeddable graphs
zbMATH Keywords: triangulation
zbMATH Keywords: torus
author: Serge Lawrencenko
reviewed by: Jozef Širáň
MaRDI profile type: Publication
cites work: Uniqueness and faithfulness of embedding of toroidal graphs
description: scientific article; zbMATH DE number 4002115