Build shapes where each vertex (connector) can only be connected to certain other vertex types.
Build by Vertex Valency

-
What happens when 3-way connectors can only be attached to 4-way connectors and vice versa. What about 3-way to 5-way connectors?
-
What are Bipartite Graphs? What is the Handshaking Lemma, and the Gale–Shapley algorithm?
-
Who is Donald Coxeter? How did his work inspire M.C. Escher and Buckminster Fuller?
-
What are Snarks and cubic graphs?
-
Create new rules and conditions and see what structures emerge. What happens if you change rules mid-build?