The validity of the strong perfect-graph conjecture for (K4-e)-free graphs

Abstract Berge's strong perfect-graph conjecture states that a graph is perfect iff it has neither C 2 n +1 nor C 2n+1 , n ≥ 2 as an induced subgraph. In this note we establish the validity of this conjecture for ( K 4 − e )-free graphs.