Unfoldings of the Cube

Abstract

Just how many different connected shapes result from slicing a cube along some of its edges and unfolding it into the plane? In this article we answer this question by viewing the cube both as a surface and as a graph of vertices and edges. This dual perspective invites an interplay of geometric, algebraic, and combinatorial techniques. The initial observation is that a cutting pattern which unfolds the cubical surface corresponds to a spanning tree of the cube graph. The Matrix-Tree theorem can be used to calculate the number of spanning trees in a connected graph, and thus allows us to compute the number of ways to unfold the cube. Since two or more spanning trees may yield the same unfolding shape, Burnside's lemma is required to count the number of incongruent unfoldings. Such a count can be an arduous task. Here we employ a combination of elementary algebraic and geometric techniques to bring the problem within the range of simple hand calculations. arXiv:1604.05004v1 [math.GR]

Shortest Paths on Cubes

“…Dudeney's solution (Figure 2 (a)), as well as the analyses of analogous shortest path problems, involve cutting along some of the edges of the room and unfolding the resulting figure (which must be a "single piece") into the plane. Unfoldings of this type are illustrated in Figure 2 (a) and analyzed in [7]. The spider and fly points in each unfolding are joined with a straight line whenever possible, and the shortest of the straight lines is chosen.…”