### 2.3.3. Graph constraint

A global constraint can be defined as a conjunction of several simple or dynamic graph constraintsFor an example of global constraint that is defined by more than one graph constraint see for instance the $\mathrm{𝚜𝚘𝚛𝚝}$ constraint and its two graph constraints. that all share the same name, the same arguments and the same argument restrictions.The arguments and the argument restrictions were described in Section 2.2.4 on page 2.2.4. This section first describes simple graph constraints and then dynamic graph constraints, which are an extension of simple graph constraints.