Protti, Fábio; Szwarcfiter, Jayme L. Clique-inverse graphs of bipartite graphs. (English) Zbl 0995.05128 J. Comb. Math. Comb. Comput. 40, 193-203 (2002). The clique graph \(K(G)\) of a graph \(G\) is the intersection graph of the family of subsets of the vertex set \(V(G)\) of \(G\) inducing maximal (by set inclusion) complete subgraphs of \(G\). Clique-inverse graphs of bipartite graphs are graphs which are clique graphs \(K(G)\) for bipartite graphs \(G\). Their properties are studied. A particular attention is paid to graphs whose clique graphs are chordal bipartite graphs (without induced subgraphs being circuits of length greater than 3) and trees. Reviewer: Bohdan Zelinka (Liberec) Cited in 4 Documents MSC: 05C75 Structural characterization of families of graphs 05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) Keywords:clique-inverse graph; clique graph; intersection graph PDFBibTeX XMLCite \textit{F. Protti} and \textit{J. L. Szwarcfiter}, J. Comb. Math. Comb. Comput. 40, 193--203 (2002; Zbl 0995.05128)