Title of article
On weakly diamond-free Berge graphs
Author/Authors
Hacène Ait Haddadene، نويسنده , , Sylvain Gravier and Julien Moncel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
4
From page
237
To page
240
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.
Journal title
Discrete Mathematics
Serial Year
1996
Journal title
Discrete Mathematics
Record number
943983
Link To Document