Johnson, Leroy, F.2023-03-012023-03-011975https://unbscholar.lib.unb.ca/handle/1882/14691A generalization of the neighborhood of a vertex [7] is used to prove several results on the relation of a set of vertices of a graph to cliques of that graph. These results lead to an efficient adaptive algorithm for enumerating the cliques of a graph. The storage requirement of the algorithm is of order O(n2).http://purl.org/coar/access_right/c_abf2technical reportComputer Science