A common generalization of line graphs and clique graphs
Journal of Graph Theory
Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cliques and extended triangles. A necessary condition for planar clique graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
The complexity of clique graph recognition
Theoretical Computer Science
The clique operator on circular-arc graphs
Discrete Applied Mathematics
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Discrete Applied Mathematics
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Edge contraction and edge removal on iterated clique graphs
Discrete Applied Mathematics
Theoretical Computer Science
| Hi-index | 0.00 |
A complete set of a graph G is a subset of V inducing a complete subgraph. A clique is a maximal complete set. Denote by the clique family of G. The clique graph of G, denoted by K(G), is the intersection graph of . Say that G is a clique graph if there exists a graph H such that G=K(H). The clique graph recognition problem asks whether a given graph is a clique graph. A sufficient condition was given by Hamelink in 1968, and a characterization was proposed by Roberts and Spencer in 1971. We prove that the clique graph recognition problem is NP-complete.