A Semi-Strong Perfect Graph Conjecture

Publisher Summary This chapter discusses the characterization of a semi-strong perfect graph conjecture. A graph is called “perfect” if, for each of its induced subgraphs F, the chromatic number of F equals the number of vertices of the largest clique in F. When the cycle has length five or seven, the assertion can be verified. The only graphs having the P 4 -structure of an odd cycle of length at least, five are the cycle itself and its complement.