A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected 2-complex every link graph of which is 3-connected admits an essentially unique locally flat embedding into the 3-sphere, if it admits one at all. This can be thought of as a generalisation of the 3-dimensional Schoenflies theorem
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractR.H. Bing showed that if a closed 3-manifold M has a triangulation in which the 3-simplexes ...
Let G be a finite graph. We give a label to each of vertices and edges of G. An embedding of G into ...
In this note we give a short and elementary proof of a more general version of Whitney's theorem tha...
AbstractWe prove Sachs′ conjecture that a graph can be embedded in 3-space so that it contains no no...
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
A graph Γ in a 3-manifold M is called planar if it is contained in an embedded 2-sphere in M. It is ...
AbstractWhitney's theorem states that 3-connected planar graphs admit essentially unique embeddings ...
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
An embedding f of a finite graph G into the 3-sphere S3 is called a spatial em-bedding of G or simpl...
We show that any embedding of the n-skeleton of a (2n+ 3)-dimensional simplex into the (2n + 1)-dime...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
AbstractIn this paper, we characterize those projective-plane 3-connected graphs which admit re-embe...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractR.H. Bing showed that if a closed 3-manifold M has a triangulation in which the 3-simplexes ...
Let G be a finite graph. We give a label to each of vertices and edges of G. An embedding of G into ...
In this note we give a short and elementary proof of a more general version of Whitney's theorem tha...
AbstractWe prove Sachs′ conjecture that a graph can be embedded in 3-space so that it contains no no...
AbstractWhitney [7] proved in 1932 that for any two embeddings of a planar 3-connected graph, their ...
A graph Γ in a 3-manifold M is called planar if it is contained in an embedded 2-sphere in M. It is ...
AbstractWhitney's theorem states that 3-connected planar graphs admit essentially unique embeddings ...
AbstractWe show that every 3-connected planar graph has a circular embedding in some nonspherical su...
An embedding f of a finite graph G into the 3-sphere S3 is called a spatial em-bedding of G or simpl...
We show that any embedding of the n-skeleton of a (2n+ 3)-dimensional simplex into the (2n + 1)-dime...
Proceedings of Graph Theory@Georgia Tech, a conference honoring the 50th Birthday of Robin Thomas, M...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
AbstractWe investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face ...
AbstractIn this paper, we characterize those projective-plane 3-connected graphs which admit re-embe...
AbstractIt is shown that embeddings of planar graphs in the projective plane have very specific stru...
AbstractR.H. Bing showed that if a closed 3-manifold M has a triangulation in which the 3-simplexes ...
Let G be a finite graph. We give a label to each of vertices and edges of G. An embedding of G into ...