EDGE COLORING OF CACTUS GRAPHS WITH GIVEN SPECTRUMS
An edge-coloring of a graph G is a coloring of the graph edges with integers such that the colors of the edges incident to any vertex of G are distinct. For an edge coloring α and a vertex v the set of all the colors of the incident edges of v is called the spectrum of that vertex in α and is denoted by
2020 ◽
Vol 44
(6)
◽
pp. 1633-1639
2020 ◽
Vol 9
(11)
◽
pp. 9311-9317
2020 ◽
Vol 9
(8)
◽
pp. 5703-5711
Keyword(s):
2020 ◽
Vol 36
(3)
◽
pp. 737-752