Read More
Date: 9-2-2016
1666
Date: 27-4-2022
1705
Date:
1847
|
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."
|
|
لصحة القلب والأمعاء.. 8 أطعمة لا غنى عنها
|
|
|
|
|
حل سحري لخلايا البيروفسكايت الشمسية.. يرفع كفاءتها إلى 26%
|
|
|
|
|
جامعة الكفيل تحتفي بذكرى ولادة الإمام محمد الجواد (عليه السلام)
|
|
|