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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-00966509
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 26, 2014 - 4:59:27 PM
Last modification on : Sunday, November 4, 2018 - 7:54:02 AM
Long-term archiving on : Thursday, June 26, 2014 - 11:56:30 AM

File

dm090108.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00966509, version 1

Collections

Citation

Bill Rosgen, Lorna Stewart. Complexity results on graphs with few cliques. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (1), pp.127--135. ⟨hal-00966509⟩

Share

Metrics

Record views

386

Files downloads

598