... EF the outermost edges of it Also, call the set of crossed edges of the e-graph the set of parallel edges of the e-graph and call the set of edges of the e-graph that are uncrossed the set of ... is the intersection of {E1 , E2 , .,Ek+1 } and the points of one of the e-graphs, and point Ek+1 is the intersection of {E1 , E2 , , Ek+1 } and the points of the other of the e-graphs Theorem ... that the tree together with the circle it is drawn on can be embedded in a surface of genus one, but not of genus zero Hough [3] observed that the number of genus one labeled circle trees on n...