On the Complexity of the S-coloring problem - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année :

## On the Complexity of the S-coloring problem

Nicolas Gastineau
• Fonction : Auteur correspondant
• PersonId : 950056

Connectez-vous pour contacter l'auteur

#### 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.

### Dates et versions

hal-00920502 , version 1 (18-12-2013)
hal-00920502 , version 2 (17-07-2014)
hal-00920502 , version 3 (29-01-2015)

### Identifiants

• HAL Id : hal-00920502 , version 1
• ARXIV :

### Citer

Nicolas Gastineau. On the Complexity of the S-coloring problem. 2013. ⟨hal-00920502v1⟩

### Exporter

BibTeX TEI Dublin Core DC Terms EndNote Datacite
223 Consultations
176 Téléchargements