Exercise 0: Show that allowing the polygons to have holes does not change the PVR#.
Exercise 1: Find CPVR#(K_n,n).
Exercise 2: Show that for every h, there exists a graph with PVR# = h.
Exercise 3: Show that one polytope is sufficient for representing any graph in three dimensions.