Complexity Results on Graphs with Few Cliques

Abstract

A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection representation that satisfies the Helly property. On any such class of graphs, some problems that are NP-complete on general graphs, such as the maximum clique problem and the maximum weighted clique problem, admit polynomial time algorithms. Other problems, such as the vertex clique cover and edge clique cover problems remain NP-complete on these classes. Several classes of graphs which have few cliques are discussed, and the complexity of some partitioning and covering problems are determined for the class of all graphs which have fewer cliques than a given polynomial bound.