Strong chromatic index of unit distance graphs

2018 ◽  
Vol 90 (4) ◽  
pp. 523-534 ◽  
Author(s):  
Michał Dębski
2017 ◽  
Vol 340 (5) ◽  
pp. 1143-1149 ◽  
Author(s):  
Mingfang Huang ◽  
Gexin Yu ◽  
Xiangqian Zhou

2007 ◽  
Vol Vol. 9 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Olivier Togni

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.


2020 ◽  
Vol 40 (1) ◽  
pp. 227-233
Author(s):  
Lily Chen ◽  
Shumei Chen ◽  
Ren Zhao ◽  
Xiangqian Zhou

2004 ◽  
Vol 33 (1) ◽  
pp. 117-123 ◽  
Author(s):  
Geoffrey Exoo

2004 ◽  
Vol 281 (1-3) ◽  
pp. 129-136 ◽  
Author(s):  
Andrzej Czygrinow ◽  
Brendan Nagle

1996 ◽  
Vol 12 (3) ◽  
pp. 295-303 ◽  
Author(s):  
Michael Reid

Sign in / Sign up

Export Citation Format

Share Document