An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torusстатья
Информация о цитировании статьи получена из
Scopus,
Web of Science
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 11 апреля 2019 г.
Аннотация:A graph of a triangulation of the torus is said to be uniquely embeddable in the torus provided all its embeddings are isomorphic as triangulations. An infinite set of torus triangulations of connectivity 5 has been constructed, with graphs that are not uniquely embeddable in the torus.