2000 character limit reached
Vertex unfoldings of tight polyhedra (1109.0001v3)
Published 31 Aug 2011 in math.CO and cs.CG
Abstract: An unfolding of a polyhedron along its edges is called a vertex unfolding if adjacent faces are allowed to be connected at not only an edge but also a vertex. Demaine et al showed that every triangulated polyhedron has a vertex unfolding. We extend this result to a tight polyhedron, where a polyhedron is tight if all non-triangular faces are mutually non-adjacent parallelograms.