 The constraint hypergraph of a constraint satisfaction problem is a hypergraph in which the vertices correspond to the variables, and the hyperedges correspond to the constraints.A set of vertices forms a hyperedge if the corresponding variables are those occurring in some constraint.A simple way to represent the constraint hypergraph is by using a classical graph with the following properties