Let n ₁+n ₂+n ₃ = n, and let G be a 2-connected graph on n vertices such that any 2-vertex cutset of G splits it into at most three parts. We prove that there exists a decomposition of the vertex set of G into three disjoint subsets V ₁, V ₂, V ₃ such that |V _i| = n _i and the induced subgraph G(V _i) is connected for every i.