Partial characterizations of clique-perfect graphs Flavia Bonomo a,1,4 Maria Chudnovsky b,2,5 Guillermo Dur´an c,3,6 a Departamento de Computaci´ on, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina. b Department of Mathematics, Princeton University, NJ, USA. c Departamento de Ingenier´ıa Industrial, Facultad de Ciencias F´ısicas y Matem´ aticas, Universidad de Chile, Santiago, Chile. Abstract A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G.A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique-transversal number and clique-independence number of G are the sizes of a minimum clique-transversal and a maximum clique-independent set of G, respec- tively. A graph G is clique-perfect if the sizes of a minimum clique-transversal and a maximum clique-independent set are equal for every induced subgraph of G. The list of minimal forbidden induced subgraphs for the class of clique-perfect graphs is not known. In this paper, we present a partial result in this direction, that is, we characterize clique-perfect graphs by a restricted list of forbidden induced subgraphs when the graph belongs to a certain class. Keywords: Claw-free graphs, clique-perfect graphs, diamond-free graphs, hereditary clique-Helly graphs, line graphs, perfect graphs.