Cliques and stable sets in undirected graphs
Maria Chudnovsky · Scuola Normale Superiore eBooks · 2014
The cochromatic number of a graph G is the minimum number of stable sets and cliques of G covering the vertex-set of G. In this paper we survey some resent results and techniques developed in an attempt to answer the question: excluding which induced subgraphs causes a graph to have bounded cochromatic number?