Read More
Date: 15-3-2022
1497
Date: 10-4-2022
2099
Date: 24-7-2016
1772
|
A -coloring of a graph is a vertex coloring that is an assignment of one of possible colors to each vertex of (i.e., a vertex coloring) such that no two adjacent vertices receive the same color.
Note that a -coloring may contain fewer than colors for .
A -coloring of a graph can be computed using MinimumVertexColoring[g, k] in the Wolfram Language package Combinatorica` , and all -colorings may be computed using MinimumVertexColoring[g, k, All] (where, however, the command returns colorings that differ by permutation of colors only a single time).
The number of distinct -colorings (where permutations of colors are counted separately) of a graph is given by , where is the chromatic polynomial of .
Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 13, 1986.
|
|
مخاطر عدم علاج ارتفاع ضغط الدم
|
|
|
|
|
اختراق جديد في علاج سرطان البروستات العدواني
|
|
|
|
|
مدرسة دار العلم.. صرح علميّ متميز في كربلاء لنشر علوم أهل البيت (عليهم السلام)
|
|
|