### 2.6.4. Common keyword

Constraints ${C}_{\mathrm{𝑒𝑛𝑡𝑟𝑦}}$ and ${C}_{\mathrm{𝑎𝑙𝑠𝑜}}$ share one or more common keywords with a strong semantic connotation.

EXAMPLE: As an example, constraints ${C}_{\mathrm{𝑒𝑛𝑡𝑟𝑦}}=$ $\mathrm{𝚝𝚛𝚎𝚎}$ and ${C}_{\mathrm{𝑎𝑙𝑠𝑜}}=$ $\mathrm{𝚌𝚢𝚌𝚕𝚎}$ are both graph partitioning constraints (i.e., constraints that partition the vertices of a given initial digraph so that each partition corresponds to a specific pattern, a tree and a circuit in this example).