EDGE COLORING OF CACTUS GRAPHS WITH GIVEN SPECTRUMS

Abstract

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