### 3.7.11. Apartition

Denotes that a constraint is defined by two graph constraints having the same initial graph, where each arc of the initial graph belongs to one of the final graphs (but not to both).