The clique graph K (G) of a given graph of the collection of maximal cliques of G. Given a family F of graphs, the clique-inverse graphs of F are the graphs whose clique graphs belong to F. In this work, we describes a characterizations for clique-inverse graphs of bipartite graphs, chordal bipartite graphs, and trees. The characterizations lead to polinomial time algorithms for the corresponding recognition problems.