CPC   2004
Wall of Fame | Most Viewed CPC-2004 Paper
136views more  CPC 2004»
10 years 6 months 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
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source136
2Download preprint from source98
3Download preprint from source92
4Download preprint from source87
5Download preprint from source83
6Download preprint from source82
7Download preprint from source76
8Download preprint from source76
9Download preprint from source70
10Download preprint from source69
11Download preprint from source68
12Download preprint from source66
13Download preprint from source65
14Download preprint from source65
15Download preprint from source62
16Download preprint from source59
17Download preprint from source51
18Download preprint from source49
19Download preprint from source46