2017
DOI: 10.1142/s021821651750050x
|View full text |Cite
|
Sign up to set email alerts
|

On chirality of toroidal embeddings of polyhedral graphs

Abstract: ABSTRACT. We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1], [2]. Building on this and using the chirality of torus knots and links [3],[4], we prove that nontrivial embeddings of simple 3-connected planar graphs in the standard torus are chiral. For the case that the spatial graph contains a nontrivial knot, the statement was shown by Castle et al [5]. We give an altern… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 14 publications
0
3
0
Order By: Relevance
“…Explicit ambient isotopies that transform spatial graphs that fulfil the assumptions of Theorem 1 into the plane R 2 , are given in [13]. Another consequence of Theorem 1 that is stated in the remark has been shown in [11] together with [14]: Nontrivial 3-connected and simple planar spatial graphs that are embedded on a torus are chiral. A graph is simple if it contains no loops and no multi-edges.…”
Section: Introductionmentioning
confidence: 90%
See 1 more Smart Citation
“…Explicit ambient isotopies that transform spatial graphs that fulfil the assumptions of Theorem 1 into the plane R 2 , are given in [13]. Another consequence of Theorem 1 that is stated in the remark has been shown in [11] together with [14]: Nontrivial 3-connected and simple planar spatial graphs that are embedded on a torus are chiral. A graph is simple if it contains no loops and no multi-edges.…”
Section: Introductionmentioning
confidence: 90%
“…It has been shown in [11] together with [14] that every nontrivial embedding of a simple 3-connected spatial graph on the torus that contains a nontrivial knot or a nonsplit link is chiral. The following remark is therefore a consequence of Theorem 1.…”
Section: The Proofmentioning
confidence: 99%
“…Tangled embeddings of polyhedral nets { f , z } are less symmetric than their untangled, regular analogs. Earlier studies of tangled nets of the tetrahedron, octahedron, and cube, generated as reticulations of the relevant { f , z } nets on the torus, established that all such “toroidal polyhedra” are topologically chiral ( 26 , 27 ), allowing a pair of distinct isotopes related to each other by a reflection. Further, those toroidal polyhedra are, without exception, rather asymmetric compared with their untangled embeddings.…”
mentioning
confidence: 99%