Discrete Mathematics & Theoretical Computer Science, Vol 9, No 1 (2007)

Font Size:  Small  Medium  Large

Strong chromatic index of products of graphs

Olivier Togni


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.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page