Acyclic,
Apartition,
Bipartite,
Circuit,
Connected component,
Consecutive loops are connected,
Directed acyclic graph,
Equivalence,
No cycle,
No loop,
One succ,
Strongly connected component,
Symmetric,
Tree,
Vpartition.
Denotes that a keyword describes the structure of the final graph associated with a constraint.