def __call__(self, index, graph):
return len(graph.neighbors[index]) == self.count<EOL>
Return True only if the number of neighbors is correct

           Arguments:
            | ``index``  --  the index of the vertex/edge on which the criterion is
                             applied
            | ``graph``  --  the graph on which the criterion is tested