Sciweavers

CPC
2004
136views more  CPC 2004»
14 years 9 days ago
On the Strong Chromatic Number
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
Penny E. Haxell