Strong chromatic index of products of graphs
2007 ◽
Vol Vol. 9 no. 1
(Graph and Algorithms)
◽
Keyword(s):
Graphs and Algorithms International audience 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.
2015 ◽
Vol 30
◽
pp. 21-28
◽
2012 ◽
Vol Vol. 14 no. 2
(Graph Theory)
◽
Keyword(s):
Keyword(s):
Keyword(s):
2019 ◽
Vol 11
(06)
◽
pp. 1950064
Keyword(s):
Keyword(s):
1967 ◽
Vol 2
(4)
◽
pp. 571-584
◽
2017 ◽
Vol 340
(5)
◽
pp. 1143-1149
◽
2021 ◽
Vol 10
(4)
◽
pp. 2115-2129