An additivity theorem for maximum genus of a graph

Let G be a finite, connected graph with no loops or multiple edges. If G is the union of two blocks, then a necessary and sufficient condition is given for the maximum genus of G to be the sum of the maximum genera of its blocks. If in addition the blocks of G are upper embeddable, then a necessary and sufficient condition is given for the upper embeddability of G.