On weakly diamond-free Berge graphs

Abstract In this paper, we present a new class of graphs named weakly diamond-free (WDF) graphs and we prove for it the strong perfect graph conjecture, by exhibiting a polynomial sequential ω-coloring algorithm. This class contains chordal graphs and perfect line-graphs.

[1]  Alan Tucker,et al.  A reduction procedure for coloring perfect K4-free graphs , 1987, J. Comb. Theory, Ser. B.

[2]  Frédéric Maffray,et al.  Coloring perfect degenerate graphs , 1997, Discret. Math..

[3]  Alan Tucker.  Coloring perfect (K4 - e)-free graphs , 1987, J. Comb. Theory, Ser. B.