Proof of a conjecture on the strong chromatic index of Halin graphs

2021 ◽  
Vol 302 ◽  
pp. 92-102
Author(s):  
Wei Yang ◽  
Baoyindureng Wu
2012 ◽  
Vol 312 (9) ◽  
pp. 1536-1541 ◽  
Author(s):  
Hsin-Hao Lai ◽  
Ko-Wei Lih ◽  
Ping-Ying Tsai

2018 ◽  
Vol 38 (1) ◽  
pp. 5
Author(s):  
Daphne Der-Fen Liu ◽  
Ziyu Hu ◽  
Ko-Wei Lih

2012 ◽  
Vol 25 (5) ◽  
pp. 898-901 ◽  
Author(s):  
Ko-Wei Lih ◽  
Daphne Der-Fen Liu

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

Sign in / Sign up

Export Citation Format

Share Document