Read More
Date: 26-3-2022
![]()
Date: 27-4-2022
![]()
Date: 11-5-2022
![]() |
A weakly perfect graph is a graph for which (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be perfect), where
is the clique number and
is the chromatic number.
All perfect graphs are weakly perfect.
The numbers of weakly perfect graphs on , 2, ... nodes are 1, 2, 4, 11, 33, 152, 1006, 11805, ... (OEIS A198634).
Maimani, H. R.; Pournaki, M. ä.; and Yassemi, S. "A Class of Weakly Perfect Graphs." Czech. Math. J. 60, 1037-1041, 2010.
Sloane, N. J. A. Sequence A198634 in "The On-Line Encyclopedia of Integer Sequences."
|
|
التوتر والسرطان.. علماء يحذرون من "صلة خطيرة"
|
|
|
|
|
مرآة السيارة: مدى دقة عكسها للصورة الصحيحة
|
|
|
|
|
نحو شراكة وطنية متكاملة.. الأمين العام للعتبة الحسينية يبحث مع وكيل وزارة الخارجية آفاق التعاون المؤسسي
|
|
|