Forcing Colorations and the Strong Perfect Graph Conjecture.
András Sebö · 1992
We give various reformulations of the Strong Perfect Graph Conjecture, based on a study of forced coloring procedures, uniquely colorable subgraphs and ! \\Gamma 1-cliques in minimal imperfect graphs.