Strong edge-coloring for jellyfish graphs
Journal
Discrete Mathematics
Journal Volume
338
Journal Issue
12
Pages
2348-2355
Date Issued
2015
Author(s)
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.
Type
journal article