On weakly diamond-free Berge graphs

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.