Structural properties of recursively partitionable graphs with connectivity 2

A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n¹,..., n^p) of jV (G)j there exists a partition (V¹,..., V^p) of V (G) such that each V_i induces a connected subgraph of G on n_i vertices. Some stronger versions of this property were introduced, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition of G must not only be con-nected but also ful_l additional conditions. In this paper, we point out some structural properties of OL-AP and R-AP graphs with connectivity 2. In particular, we show that deleting a cut pair of these graphs results in a graph with a bounded number of components, some of whom have a small number of vertices. We obtain these results by studying a simple class of 2-connected graphs called balloons.