1990
DOI: 10.1007/bf01104169
|View full text |Cite
|
Sign up to set email alerts
|

Irreducible triangulations of the torus

Abstract: By Steinitz' Theorem all triangulations of a sphere are generated from one triangulation with four vertices by certain sequences of operations called vertex splittings. A theorem of Barnette asserts that all triangulations of the projective plane can be generated from two irreducible triangulations.In the present work we obtain an analogous result for the torus: we show that all triangulations of the torus are generated by 21 irreducible triangulations (they are found explicitly) by applying the same vertex sp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
45
0

Year Published

1995
1995
2016
2016

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 50 publications
(45 citation statements)
references
References 4 publications
0
45
0
Order By: Relevance
“…Hereafter we will use the symbols TPn and TAn to refer to toroidal lattices with 2n disclination pairs and symmetry group D nh and D nd respectively. A systematic construction of defected triangulations of the torus can be achieved in the context of planar graphs [188,189,190]. A topological embedding of a graph in a two-dimensional manifold corresponds to a triangulation of the manifold if each region of the graph is bounded by exactly three vertices and three edges, and any two regions have either one common vertex or one common edge or no common elements of the graph.…”
Section: Geometry Of Toroidal Polyhedramentioning
confidence: 99%
“…Hereafter we will use the symbols TPn and TAn to refer to toroidal lattices with 2n disclination pairs and symmetry group D nh and D nd respectively. A systematic construction of defected triangulations of the torus can be achieved in the context of planar graphs [188,189,190]. A topological embedding of a graph in a two-dimensional manifold corresponds to a triangulation of the manifold if each region of the graph is bounded by exactly three vertices and three edges, and any two regions have either one common vertex or one common edge or no common elements of the graph.…”
Section: Geometry Of Toroidal Polyhedramentioning
confidence: 99%
“…Lawrencenko [14] has determined the complete set I of 21 irreducible toroidal triangulations, and the graphs K 7 , K 8 − 4K 2 , K 9 − C 9 , and K 9 − 3K 3 are exactly the 6-regular graphs in I. So already Lawrencenko's result implies that these four graphs are minor-minimal 6-regular toroidal graphs.…”
Section: Old and New Resultsmentioning
confidence: 92%
“…A triangulation G is irreducible if G has no contractible edge. It is known that every surface admits finitely many irreducible triangulations, up to homeomorphism , and the complete lists of irreducible triangulations are known for S0 , S1 , S2 , N1 , N2 , N3, and N4 . (See for more details about irreducible triangulations.…”
Section: Applicationmentioning
confidence: 99%