(3,3)(3,3)-Linked planar graphs

A graph G   is (m,n)(m,n)-linked   if for any two disjoint subsets R,B⊂V(G)R,B⊂V(G) with |R|⩽m|R|⩽m and |B|⩽n|B|⩽n, G has two disjoint connected subgraphs containing R and B  , respectively. We shall prove that a planar graph with at least six vertices is (3,3)(3,3)-linked if and only if G is 4-connected and maximal.