A semi-strong perfect graph theorem (Q1104341)

The perfectness of a graph G was defined by Berge in 1961. He also proposed the following two conjectures: (1) G is perfect if and only if it contains no induced subgraph isomorphic to an odd cycle of length greater than three or the complement of such a cycle (strong perfect graph conjecture) and (2) G is perfect if and only if \(\bar G\) is perfect (weak perfect graph conjecture). The proof of (2) was presented by \textit{L. Lovász} [Discrete Math. 2, 253-267 (1972; Zbl 0239.05111)]. \textit{V. Chvátal} [Perfect graph, Ann. Discrete Math. 21, 279-280 (1984; Zbl 0557.05043)] introduced a \(P_ 4\)-isomorphism between two graphs and interposed a new conjecture (say (1.5)) between (1) and (2): If a graph H is \(P_ 4\)-isomorphic to a perfect graph then H is perfect (semi-strong perfect graph conjecture). The aim of the paper under review is to prove (1.5).