An analogue of a theorem of Steinitz for ball polyhedra in $$\mathbb {R}^3$$
AbstractSteinitz’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$$ R 3 .
1970 ◽
Vol 13
(4)
◽
pp. 447-449
◽
Keyword(s):
2017 ◽
Vol 73
(1)
◽
pp. 77-80
◽
Keyword(s):
2016 ◽
Vol 72
(5)
◽
pp. 582-585
◽
2014 ◽
Vol 25
(07)
◽
pp. 1450071
◽
1977 ◽
Vol 35
◽
pp. 562-563
Structural preservation and absolute contrast of catalase crystal sections prepared with tannic acid
1983 ◽
Vol 41
◽
pp. 448-449
Keyword(s):
X Rays
◽
1991 ◽
Vol 49
◽
pp. 914-915
1988 ◽
Vol 46
◽
pp. 152-153
◽
1976 ◽
Vol 34
◽
pp. 160-161
1992 ◽
Vol 50
(2)
◽
pp. 1040-1041