Hits :

Author : Yang, Daqing; Zhu, Xuding

Date of Publication : 2016-01-01

Journal : Journal of Graph Theory

Affiliation of Author(s) : 数理与信息工程学院

Volume : Vol.83

Issue : No.4

Page Number : 334-339

ISSN : 0364-9024;1097-0118

Key Words : strong;chromatic;index;coloring;number;line;graph;maximum;average;degree;of;a;graph

Abstract : A coloring of the edges of a graph G is strong if each color class is an induced matching of G. The strong chromatic index of G, denoted by

Translation or Not : no