Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944)

A graph is perfect if its chromatic number is equal to the size of its largest clique. C. Berge's strong perfect graph conjecture [\textit{C. Berge}, Les problèmes de coloration en théorie des graphes, Publ. Inst. Stat. Univ. Paris, 9, 123-160 (1960)] is that a graph is perfect if and only if it does not contain an induced subgraph isomorphic to a chordless cycle with at least 5 vertices or to the complement of such a cycle. This conjecture has been shown to be true for graphs not containing certain forbidden induced subgraphs, for example a 4-clique [\textit{A. Tucker}, The validity of the perfect graph conjecture for \(K_ 4\)-free graphs, Perfect graphs, Ann. Discrete Math. 21, 149-157 (1984; Zbl 0566.05028)]. In the paper under review, it is shown to be true for graphs with no induced length-5 path and no 5-clique, from which it follows that a graph with no induced 5-path, 5-clique, 5-cycle, complement of a 7-cycle or complement of a 9-cycle is perfect. This class of graphs is shown not to be contained in any other known class of perfect graphs.