| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646955 | Discrete Mathematics | 2015 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gerard J. Chang, Sheng-Hua Chen, Chi-Yun Hsu, Chia-Man Hung, Huei-Ling Lai,