AbstractWe prove the following theorem: A polyhedral embedding of a 2-dimensional cell complex in S3 is determined up to ambient isotopy rel the 1-skeleton by the embedding of the 1-skeleton, provided the cell complex is ‘proper’ and ‘fine enough’. Applications of the theorem are given in distinguishing certain graphs in S3 from their mirror images. (This is of interest to chemists studying stereoisomerism.) Examples are given to illustrate that the theorem can fail without either hypothesis ‘proper’ or ‘fine enough’. The main theorem may be generalized by replacing S3 by an irreducible 3-manifold with nonempty boundary
We determine for which m the complete graph Km has an embedding in S3 whose topological symmetry gro...
The hexabasic book is the cone of the 1–dimensional skeleton of the union of two tetrahedra glued al...
AbstractLet G be a graph, G′ an embedding of G as a straight 1-complex in Rn, the real coordinate sp...
AbstractWe prove the following theorem: A polyhedral embedding of a 2-dimensional cell complex in S3...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
We investigate the following problem: Given two embeddings G1 and G2 of the same abstract graph G on...
A graph Γ in a 3-manifold M is called planar if it is contained in an embedded 2-sphere in M. It is ...
In previous work we proposed a combinatorial algorithm to \locally repair" the cubical complex Q(I)...
AbstractA combinatorial characterization of the 1-skeletons of the Cohen–Macaulay complexes of dimen...
We consider some aspects of the global geometry of cellular complexes. Motivated by techniques in g...
graph G on an orientable surface S, decide whether G1 and G2 are isotopic; in other words, whether t...
AbstractFrom each G in a certain class of 4-regular edge-colored graphs we obtain a ball complex who...
We determine for which m the complete graph Km has an embedding in S3 whose topological symmetry gro...
Two 2-cell embeddings A +/-: X -> S and j: X -> S of a connected graph X into a closed orientable su...
A simple cell complex C in Euclidean d-space Ed is a covering of Ed by finitely many convex j-dimens...
We determine for which m the complete graph Km has an embedding in S3 whose topological symmetry gro...
The hexabasic book is the cone of the 1–dimensional skeleton of the union of two tetrahedra glued al...
AbstractLet G be a graph, G′ an embedding of G as a straight 1-complex in Rn, the real coordinate sp...
AbstractWe prove the following theorem: A polyhedral embedding of a 2-dimensional cell complex in S3...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
We investigate the following problem: Given two embeddings G1 and G2 of the same abstract graph G on...
A graph Γ in a 3-manifold M is called planar if it is contained in an embedded 2-sphere in M. It is ...
In previous work we proposed a combinatorial algorithm to \locally repair" the cubical complex Q(I)...
AbstractA combinatorial characterization of the 1-skeletons of the Cohen–Macaulay complexes of dimen...
We consider some aspects of the global geometry of cellular complexes. Motivated by techniques in g...
graph G on an orientable surface S, decide whether G1 and G2 are isotopic; in other words, whether t...
AbstractFrom each G in a certain class of 4-regular edge-colored graphs we obtain a ball complex who...
We determine for which m the complete graph Km has an embedding in S3 whose topological symmetry gro...
Two 2-cell embeddings A +/-: X -> S and j: X -> S of a connected graph X into a closed orientable su...
A simple cell complex C in Euclidean d-space Ed is a covering of Ed by finitely many convex j-dimens...
We determine for which m the complete graph Km has an embedding in S3 whose topological symmetry gro...
The hexabasic book is the cone of the 1–dimensional skeleton of the union of two tetrahedra glued al...
AbstractLet G be a graph, G′ an embedding of G as a straight 1-complex in Rn, the real coordinate sp...