A graph is a split graph if its vertices can be partitioned into a clique a
nd a stable set. A graph is a k-split graph if its vertices can be partitio
ned into k sets, each of which induces a split graph. We show that the stro
ng perfect graph conjecture is true for 2-split graphs and we design a poly
nomial algorithm to recognize a perfect 2-split graph.