  Here in particular, we give a characterization of Quasi-line Graphs in terms
of forbidden induced subgraphs. In general, we prove a necessary and sufficient
condition for a graph to be a union of two cliques.

Combinatorics