Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal-univ-bourgogne.archives-ouvertes.fr/hal-00655721
Contributor : Olivier Togni <>
Submitted on : Tuesday, June 3, 2014 - 1:58:40 PM
Last modification on : Monday, March 30, 2020 - 8:50:56 AM
Document(s) archivé(s) le : Wednesday, September 3, 2014 - 10:37:39 AM

File

677-2394-1-PB.pdf
Explicit agreement for this submission

Identifiers

  • HAL Id : hal-00655721, version 1

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⟩

Share

Metrics

Record views

330

Files downloads

617