### 3.7.108. Graph partitioning constraint

A constraint that partitions the vertices of a given initial graph and that keeps one single successor for each vertex so that each partition corresponds to a specific pattern.