A well-known result of Bondy and Chvátal establishes that a graph with order n is Hamiltonian if and only if its n-closure (obtained through repeatedly adding an edge joining any two non-adjacent vertices with degree sum at least n) also is. In this work, we investigate such closure results for arbitrarily partitionable graphs, a weakening of Hamiltonian graphs being those graphs that can be partitioned into arbitrarily many connected graphs with arbitrary orders. Among other results, we establish closure results for arbitrary partitions into connected graphs with order at most 3, for arbitrary partitions into connected graphs with order exactly any λ, and for the property of being arbitrarily partitionable in full.