Strong chromatic index of products of graphs

Abstract : The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for strong chromatic index of three different products of graphs in term of the strong chromatic index of each factor. For the cartesian product of paths, cycles or complete graphs, we derive sharper results. In particular, strong chromatic indices of d-dimensional grids and of some toroidal grids are given along with approximate results on the strong chromatic index of generalized hypercubes.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (1), p. 47-56
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00655721
Contributeur : Olivier Togni <>
Soumis le : mardi 3 juin 2014 - 13:58:40
Dernière modification le : mercredi 4 juin 2014 - 13:42:42
Document(s) archivé(s) le : mercredi 3 septembre 2014 - 10:37:39

Fichier

677-2394-1-PB.pdf
Accord explicite pour ce dépôt

Identifiants

  • HAL Id : hal-00655721, version 1

Collections

Citation

Olivier Togni. Strong chromatic index of products of graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (1), p. 47-56. 〈hal-00655721〉

Partager

Métriques

Consultations de
la notice

184

Téléchargements du document

133