Faenza, Y.Oriolo, G.Snels, C.2012-10-252012-10-252012-10-25201110.1016/j.orl.2011.04.002https://infoscience.epfl.ch/handle/20.500.14299/86264We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be embedded in a simple algorithm that in at most |E(G)| steps builds a new graph G′ without proper and homogeneous pairs of cliques, and such that G and G′ agree on the value of some relevant invariant (or property). © 2011 Elsevier B.V. All rights reserved.Proper and homogeneous pairs of cliquesReductionsGraph invariantstext::journal::journal article::research article