2000 character limit reached
Common Edge-Unzippings for Tetrahedra (1105.5401v2)
Published 26 May 2011 in cs.CG and cs.DM
Abstract: It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.