The most common technique for the parallelization of multi- grid methods is grid partitioning. For such methods Brandt and Diskin have suggested the use of a variant of segmental refinement in order to re- duce the amount of inter-processor communication. A parallel multigrid method with this technique avoids all communication on the finest grid levels. This article will examine some features of this class of algorithms as compared to standard parallel multigrid methods. In particular, the communication pattern will be analyzed in detail.