Olivier Togni - Strong chromatic index of products of graphs

dmtcs:414 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, Vol. 9 no. 1 - https://doi.org/10.46298/dmtcs.414
Strong chromatic index of products of graphs

Authors: Olivier Togni ORCID-iD1

  • 1 Laboratoire Electronique, Informatique et Image [UMR6306]

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.

Volume: Vol. 9 no. 1
Section: Graph and Algorithms
Published on: January 1, 2007
Imported on: March 26, 2015
Keywords: strong product,Strong edge colouring,induced matching,Cartesian product,Kronecker product,strong product.,MSC 05C15,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/s0166-218x(01)00237-2
  • 10.1016/s0166-218x(01)00237-2
On the computational complexity of strong edge coloring

1 Document citing this article

Consultation statistics

This page has been seen 269 times.
This article's PDF has been downloaded 351 times.