Strong chromatic index of products of graphs - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2007

Strong chromatic index of products of graphs

Résumé

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.
Fichier principal
Vignette du fichier
677-2394-1-PB.pdf (141.95 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00655721 , version 1 (03-06-2014)

Identifiants

Citer

Olivier Togni. Strong chromatic index of products of graphs. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 1 (1), p. 47-56. ⟨10.46298/dmtcs.414⟩. ⟨hal-00655721⟩
195 Consultations
1832 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More