Suppose we build S2 from a finite collection of polygons by identifying edges in pairs. Show that in the resulting CW structure on S2 the 1-skeleton cannot be either of the two graphs shown, with five and six vertices. [This is one step in a proof that neither of these graphs embeds in R2.]