# Graph terminology query

My problem is on this website:

http://genealogy.math.ndsu.nodak.edu/extrema.php

Under the "nonplanarity" section, I don't understand what it means when it says "Interestingly, Gauß is the only vertex that needs to be connected by paths with more than one edge."

Any clarification of this would be greatly appreciated.

-
The diagram is a graph which is being identified as a subdivision (en.wikipedia.org/wiki/Homeomorphism_(graph_theory)#Subdivisions) of $K_{3,3}$ (en.wikipedia.org/wiki/Bipartite_graph), which shows that it is not planar. The sentence observes that we have to use a subdivision in this case and not just $K_{3,3}$ because Gauss is not connected to the other vertices by paths with one edge. Which word in that sentence is confusing you? – Qiaochu Yuan Jun 13 '11 at 22:44
A right; that's what I thought it meant. Thanks for clarifying. I was unsure what we were trying to connect Gauss to via a path - I understand fully now. Thanks – Anon888 Jun 13 '11 at 22:46
@Qiaochu: why don't you provide what you wrote in your comment as an "official" answer, so the question has a helpful (as your comment is/was) answer. Just a thought. (I don't mean to be telling you what to do!) – amWhy Jun 13 '11 at 23:22

As noted by Qiaochu in the comments, the graph is nonplanar because it contains a subdivision of $K_{3,3}$. However, it does not contain $K_{3,3}$ as a subgraph (only as a topological minor). The diagram shows the $K_{3,3}$ subdivision and that the Gauss node is connected to Weierstrass by a path of length $2$ and connected to Kummer by a path of length $3$.