In [48] S. Hazan and V. Neumann-Lara investigate clique
graphs: If *G*=(*V*,*E*) is a graph, then its
**clique graph k(G)**
has the maximal cliques of

This result provides a new algorithm to approach the fixed point property, namely by computation of clique graphs. The theory in that direction seems to be unexplored and even though the algorithm might be inefficient, the connection is quite surprising and very interesting.

Bernd.S.W.Schroder