Kamalian, R.R.
(Algebra and Discrete Mathematics, 2015)
A proper edge t-coloring of a graph G is a coloring of edges of
G with colors 1,2,…,t such that all colors are used, and no
two adjacent edges receive the same color. The set of colors of
edges incident with a vertex ...