ملخص: 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 [omega]-coloring any Berge graph for this subclass. This subclass contains K4-free graphs and chordal graphs.

لغة: إنجليزية