Theorem 1. Let G = (V, E) and H = (W, F ) be planar graphs and A = C(V ′ , V ′′ ) and B = C(W ′ , W ′′ ) be inclusion-minimal cuts in G and H, respectively, with |A| = |B|. Then there exists a planar join