Add to ORKGSteinitz's theorem states that a graph $G$ is the edge-graph of a $3$-dimensional convex polyhedron if and only if, $G$ is simple, plane and $3$-connected. We prove an analogue of this theorem for ball polyhedra, that is, for intersections of finitely many unit balls in $\mathbb{R}^3$
A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls i...
AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
Steinitz's theorem states that a graph G is the edge-graph of a 3-dimensional convex polyhedron if a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a <em>simple orthogonal polyhedron</em> to be a three-dimensional polyhedron with the topo...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
AbstractIn this paper we introduce ball-polyhedra as finite intersections of congruent balls in Eucl...
Abstract. We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the top...
AbstractRelations between graph theory and polyhedra are presented in two contexts. In the first, th...
A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls i...
AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
Steinitz's theorem states that a graph G is the edge-graph of a 3-dimensional convex polyhedron if a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a <em>simple orthogonal polyhedron</em> to be a three-dimensional polyhedron with the topo...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a...
AbstractIn this paper we introduce ball-polyhedra as finite intersections of congruent balls in Eucl...
Abstract. We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the top...
AbstractRelations between graph theory and polyhedra are presented in two contexts. In the first, th...
A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls i...
AbstractIt is a consequence of a theorem of Steinitz that the boundary of every convex 3-dimensional...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...