Strong edge-coloring for jellyfish graphs

doi:10.1016/j.disc.2015.04.031

Title:	Strong edge-coloring for jellyfish graphs
Authors:	Chang, Gerard J. Chen, Sheng-Hua Hsu, Chi-Yun Hung, Chia-Man Lai, Huei-Ling 應用數學系 Department of Applied Mathematics
Keywords:	Strong edge-coloring;Strong chromatic index;Cycle;Cactus;Block
Issue Date:	6-Dec-2015
Abstract:	A strong edge-coloring of a graph is a function that assigns to each edge a color such that two edges within distance two apart receive different colors. The strong chromatic index of a graph is the minimum number of colors used in a strong edge-coloring. This paper determines strong chromatic indices of cacti, which are graphs whose blocks are cycles or complete graphs of two vertices. The proof is by means of jellyfish graphs. (C) 2015 Elsevier B.V. All rights reserved.
URI:	http://dx.doi.org/10.1016/j.disc.2015.04.031 http://hdl.handle.net/11536/128116
ISSN:	0012-365X
DOI:	10.1016/j.disc.2015.04.031
Journal:	DISCRETE MATHEMATICS
Volume:	338
Issue:	12
Begin Page:	2348
End Page:	2355
Appears in Collections:	Articles