The chromatic number of G is chi(G) = min{k | there exists a k-coloring of G}. A k-coloring of G is a partition into k sets of vertices such that in each of these sets, none of the members form edges with each other.
i1 : G = cycleGraph 5; |
i2 : chromaticNumber G o2 = 3 |
The object chromaticNumber is a method function.