Classifying Genus Two 3-Manifolds up to 34 Tetrahedra

Abstract In this paper, we present a catalogue of all genus two 3-manifolds admitting a contracted triangulation with at most 34 simplexes. Then we give a complete classification of the above manifolds.

[1]  Sergei Matveev,et al.  Complexity theory of three-dimensional manifolds , 1990, Acta Applicandae Mathematicae.

[2]  Luigi Grasselli,et al.  2-Symmetric Transformations for 3-Manifolds of Genus 2 , 2000, J. Comb. Theory, Ser. B.

[3]  Massimo Ferri,et al.  Crystallisations of 2-fold branched coverings of ³ , 1979 .

[4]  Luigi Grasselli,et al.  2-Symmetric crystallizations and 2-fold branched coverings of S3 , 1991, Discret. Math..

[5]  Carlo Gagliardi,et al.  Extending the concept of genus to dimension $n$ , 1981 .

[6]  Sóstenes Lins,et al.  Gems, Computers and Attractors for 3-Manifolds , 1995 .

[7]  M. R. Casali,et al.  A Code for m-Bipartite Edge-Coloured Graphs , 2001 .

[8]  Sóstenes Lins,et al.  The Fundamental Groups of Closed orientable 3-Manifolds admitting Colored Triangulations with Less than 30 Tetrahedra , 1995, Int. J. Algebra Comput..

[9]  James A. Ibers,et al.  International tables for X-ray crystallography , 1962 .

[10]  M. R. Casali.  Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory , 2004 .

[11]  Sergei Matveev,et al.  Algorithmic Topology and Classification of 3-Manifolds , 2003 .

[12]  C. Rourke,et al.  Introduction to Piecewise-Linear Topology , 1972 .

[13]  Frank Harary,et al.  Graph Theory , 2016 .

[14]  José Montesinos,et al.  Classical tessellations and three-manifolds , 1987 .

[15]  Carlo Gagliardi,et al.  Regular imbeddings of edge-coloured graphs , 1981 .

[16]  Bruno Martelli,et al.  Three-Manifolds Having Complexity At Most 9 , 2001, Exp. Math..

[17]  Maria Rita Casali,et al.  A catalogue of the genus two 3-manifolds , 1989 .

[18]  Carlo Gagliardi,et al.  A graph-theoretical representation of PL-manifolds — A survey on crystallizations , 1986 .