Sciweavers

WG   2001 International Workshop on Graph-Theoretic Concepts in Computer Science
Wall of Fame | Most Viewed WG-2001 Paper
WG
2001
Springer
13 years 9 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...
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.
IdReadViewsTitleStatus
1Download preprint from source127
2Download preprint from source94
3Download preprint from source93
4Download preprint from source93
5Download preprint from source87
6Download preprint from source82
7Download preprint from source81
8Download preprint from source79
9Download preprint from source69