DOIAbstract
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices are determined. Using similar methods we show that one cannot always preassign the shape of a facet of a 4-polytope
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices are determined. Using similar methods we show that one cannot always preassign the shape of a facet of a 4-polytope
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
AbstractLet M be an n-vertex combinatorial triangulation of a Z2-homology d-sphere. In this paper we...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary o...
AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary o...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
AbstractTriangulated 4-dimensional manifolds with n vertices are considered such that any triple of ...
We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 24...
AbstractA complete classification is given for non-neighborly combinatorial 3-manifolds with nine ve...
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
AbstractLet M be an n-vertex combinatorial triangulation of a Z2-homology d-sphere. In this paper we...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
AbstractThe different combinatorial types of triangulations of the 3-sphere with up to 8 vertices ar...
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
AbstractAn algorithm to enumerate the combinatorial types of three-spheres is described. The respect...
AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary o...
AbstractA triangulated 3-sphere is said to be polyhedral provided it is isomorphic to the boundary o...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
AbstractThe classification of the 1296 (simplicial) 3-spheres with nine vertices into polytopal and ...
AbstractTriangulated 4-dimensional manifolds with n vertices are considered such that any triple of ...
We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 24...
AbstractA complete classification is given for non-neighborly combinatorial 3-manifolds with nine ve...
Let Mu be an n-vertex combinatorial triangulation of a Ζ2-homology d-sphere. In this paper we p...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
AbstractLet M be an n-vertex combinatorial triangulation of a Z2-homology d-sphere. In this paper we...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
Add to ORKG