ABSTRACT. Froper homotopy equivalent compact P:-irreducible and sufficiently large 3-manifolds are homeomorp,ic. The result is not kF,cwn for irreducible 3-manifolds that contain 2-sided projective planes. ven if one assumes the Poincareconjecture. i this paper to such a 3-mnifold M is associated a graph G(M) that specifies Low a maximal system of mutually disjoint non-isotopic projective pla,es is embedded in M; ad it is sho:; that G(M) is an invaria:t of the homotupy type cf M. On the uth hand it is shown that ay giveF, graph can be realzed as G(M) for infir.itely man;, irreducible and boundary irreducible M. As an applicatior, it is shown that any closed irreducible 3-manifold M that contains 2-sidle projective planes c; be obtied from a...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
AbstractWe prove that there is an algorithm which determines whether or not a given 2-polyhedron can...
Proper homotopy equivalent compact P2-irreducible and sufficiently large 3-manifolds are homemorphic...
A description is obtained for the homeotopy group (the group of iso-topy classes of homeomorphisms) ...
AbstractWe prove that there is an algorithm which determines whether or not a given 2-polyhedron can...
AbstractThis note concerns 3-manifolds M obtained by Dehn surgery on a knot in S3, in particular tho...
AbstractIt is shown that if W is an irreducible 3-manifold, then any two disjoint embedded nontrivia...
AbstractThis note concerns 3-manifolds M obtained by Dehn surgery on a knot in S3, in particular tho...
A graph Γ in a 3-manifold M is called planar if it is contained in an embedded 2-sphere in M. It is ...
. Given any connected, open 3-manifold U having finitely many ends, a non-compact 3-manifold M is co...
As it is well-known, the boundary of the orientable I-bundle $K X^sim I $ over the Klein bottle K is...
As it is well-known, the boundary of the orientable I-bundle $K X^sim I $ over the Klein bottle K is...
This paper poses some basic questions about instances (hard to find) of a special problem in 3-manif...
In this paper we associate a group γH to each bipartite 3-gem H. By using the recent (Theorem 1) gra...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
AbstractWe prove that there is an algorithm which determines whether or not a given 2-polyhedron can...
Proper homotopy equivalent compact P2-irreducible and sufficiently large 3-manifolds are homemorphic...
A description is obtained for the homeotopy group (the group of iso-topy classes of homeomorphisms) ...
AbstractWe prove that there is an algorithm which determines whether or not a given 2-polyhedron can...
AbstractThis note concerns 3-manifolds M obtained by Dehn surgery on a knot in S3, in particular tho...
AbstractIt is shown that if W is an irreducible 3-manifold, then any two disjoint embedded nontrivia...
AbstractThis note concerns 3-manifolds M obtained by Dehn surgery on a knot in S3, in particular tho...
A graph Γ in a 3-manifold M is called planar if it is contained in an embedded 2-sphere in M. It is ...
. Given any connected, open 3-manifold U having finitely many ends, a non-compact 3-manifold M is co...
As it is well-known, the boundary of the orientable I-bundle $K X^sim I $ over the Klein bottle K is...
As it is well-known, the boundary of the orientable I-bundle $K X^sim I $ over the Klein bottle K is...
This paper poses some basic questions about instances (hard to find) of a special problem in 3-manif...
In this paper we associate a group γH to each bipartite 3-gem H. By using the recent (Theorem 1) gra...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
AbstractWe prove that there is an algorithm which determines whether or not a given 2-polyhedron can...