Clique-inverse graphs ofK3-free andK4-free graphs
Fábio Protti, Jayme Luiz SZWARCFITER · Journal of Graph Theory · 2000
The clique graph K(G) of a given graph G is the intersection graph of the collection of maximal cliques of G. Given a family ℱ of graphs, the clique-inverse graphs of ℱ are the graphs whose clique graphs belong to ℱ. In this work, we describe characterizations for clique-inverse graphs of K3-free and K4-free graphs. The characterizations are formulated in terms of forbidden induced subgraphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 257–272, 2000