Title of article
On the quasi-locally paw-free graphs Original Research Article
Author/Authors
Hacène Ait Haddadene، نويسنده , , Meriem Mechebbek، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
4
From page
37
To page
40
Abstract
In this paper, we present a new class of graphs named quasi-locally paw-free (QLP) graphs. We prove the strong perfect graph conjecture for a subclass of QLP class, by exhibiting a polynomial combinatorial algorithm for ω-coloring any Berge graph for this subclass. This subclass contains K4-free graphs and chordal graphs.
Keywords
Perfect graph , Polynomial combinatorial algorithm , Quasi-locally paw-free graphs , Strong perfect graph conjecture
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949115
Link To Document