DM
2008
13 years 11 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
DM
2010
13 years 11 months ago
2010
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...