Abstract: A graph is called a cograph contraction if it is obtained from a cograph (a graph with no induced path on four vertices) by contracting some pairwise disjoint independent sets and then making the ‘‘contracted’ ’ vertices pairwise adjacent. Cograph contractions are perfect and generalize cographs and split graphs. This article gives a good characterization of cograph contractions, solving 