The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
New results on generalized graph coloring
[article]
2003
arXiv
pre-print
For graph classes P_1,...,P_k, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph G can be partitioned into subsets V_1,...,V_k so that V_j induces a graph in the class P_j (j=1,2,...,k). If P_1 = ... = P_k is the class of edgeless graphs, then this problem coincides with the standard vertex k- colorability, which is known to be NP-complete for any k> 3. Recently, this result has been generalized by showing that if all P_i's are additive
arXiv:math/0306178v1
fatcat:xuzu6r3dxjbalmpofrnm524kvu