Strong
chromatic index of graphs: a short survey
Xiaodan Zhao1,
Xiaofeng Zhou2
2Yellow River Conservancy Technical Institute, Kaifeng,
475004, China
Abstract— A strong edge coloring of a graph G is an edge coloring such that every two
adjacent edges or two edges adjacent to a same edge receive two distinct
colors; in other words, every path of length three has three distinct colors in
G. The strong chromatic index of G, denoted by 
, is the smallest integer k such that G admits a strong edge
coloring with k colors. This survey is
an brief introduction to some good results regarding the strong chromatic index
of planar graphs, bipartite graphs and so on.
, is the smallest integer k such that G admits a strong edge
coloring with k colors. This survey is
an brief introduction to some good results regarding the strong chromatic index
of planar graphs, bipartite graphs and so on. 
No comments:
Post a Comment