A solid polycube is a face-connected set of unit cubes, where, unlike classical definitions for polycubes, shared faces between adjacent cubes are not removed. We prove by mathematical induction that any such polycube can be edge-unfolded into a 2D net without refinement. Our proof relies on the concept of a perfect net, defined as a net in which two designated edges are placed on the far left and far right sides. This configuration enables consistent gluing of nets in a single direction throughout the induction process, thereby guaranteeing that no overlaps occur at any step.
Discrete Mathematics & Theoretical Computer Science