Abstract
An \emph{edge coloring} of a graph is strong if each color class is an induced matching of . The \emph{strong chromatic index} of , denoted by , is the minimum number of colors for which has a strong edge coloring. The strong chromatic index of is equal to the chromatic number of the square of the line graph of . The chromatic number of the square of the line graph of is greater than or equal to the clique number of the square of the line graph of , denoted by . In this note we prove that for every graph . Our result allows to calculate an upper bound for the fractional strong chromatic index of , denoted by . We prove that for every graph .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.