On the Complexity of the S-coloring problem
Résumé
This work establishes the complexity class of several instances of the S-coloring problem: For a graph G, a positive integer k and a non decreasing list of integers S = (s1 , . . . , sk ), G admits a S-coloring, if its vertices can be partitioned into sets Xsi , i = 1, . . . , k, where each Xsi being an si -packing (a set of vertices at pairwise distance greater than si ). For a unfixed size of list, the complexity of the S-coloring problem is determined for several instances of the problem.
Origine : Fichiers produits par l'(les) auteur(s)