A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the clique operator
[chapter]
1998
Lecture Notes in Computer Science
The clique operator K maps a graph G into its clique graph, which is the intersection graph of the (maximal) cliques of G. Among all the better studied graph operators, K seems to be the richest one and many questions regarding it remain open. In particular, it is not known whether recognizing a clique graph is in P. In this note we describe our progress toward answering this question. We obtain a necessary condition for a graph to be in the image of K in terms of the presence of certain
doi:10.1007/bfb0054327
fatcat:racvmnrqpzhddbnp6y74fpnyua