If we color the edges of a polyhedron and then break it apart into its polygonal faces we obtain a set of polygons with colored edges. We explore here the opposite problem: find sets of polygons with colored edges that can be assembled into various polyhedra by joining them along edges of the same color. We show how solutions to this problem can be used to design construction systems for building strong polyhedra models.