On the complexity of determining the irregular chromatic index of a graph - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Discrete Algorithms Année : 2015

On the complexity of determining the irregular chromatic index of a graph

Résumé

An undirected simple graph $G$ is locally irregular if adjacent vertices of $G$ have different degrees. An edge-colouring $\phi$ of $G$ is locally irregular if each colour class of $\phi$ induces a locally irregular subgraph of $G$. The irregular chromatic index $\chi_{irr}'(G)$ of $G$ is the least number of colours used by a locally irregular edge-colouring of $G$ (if any). We show that the problem of determining the irregular chromatic index of a graph can be handled in linear time when restricted to trees, but it remains NP-complete in general.
Fichier principal
Vignette du fichier
bbs-locally.pdf (386.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00921849 , version 1 (21-12-2013)
hal-00921849 , version 2 (25-12-2014)

Identifiants

  • HAL Id : hal-00921849 , version 2

Citer

Olivier Baudon, Julien Bensmail, Eric Sopena. On the complexity of determining the irregular chromatic index of a graph. Journal of Discrete Algorithms, 2015, 30, pp.113-127. ⟨hal-00921849v2⟩

Collections

CNRS TDS-MACS
287 Consultations
300 Téléchargements

Partager

Gmail Facebook X LinkedIn More