Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture

We introduce the class of graphs such that every induced subgraph possesses a vertex whose neighbourhood can be split into a clique and a stable set. We prove that this class satisfies Berge′s strong perfect graph conjecture. This class contains several well-known classes of (perfect) graphs and is polynomially recognizable.