A characterization of upper-embeddable graphs
Mark Jungerman · Transactions of the American Mathematical Society · 1978
It is proved that a pseudograph G is upper-embeddable if and only if it has a spanning tree T such that G - T has at most one component with an odd number of edges. This result is then used to show that all 4-edge connected graphs are upper-embeddable.