Open AccessINTERVAL EDGE COLORING OF TREES WITH STRICT RESTRICTIONS ON THE SPECTRUMS
Author(s) -
Albert Khachik Sahakyan
Publication year - 2021
Publication title -
science review
Language(s) - English
Resource type - Journals
eISSN - 2544-9443
pISSN - 2544-9346
DOI - 10.31435/rsglobal_sr/30072021/7592
Subject(s) - combinatorics , vertex (graph theory) , mathematics , edge coloring , complete coloring , fractional coloring , graph , interval (graph theory) , discrete mathematics , graph coloring , list coloring , graph power , line graph
An edge-coloring of a graph G with consecutive integers C1 ,..., Ct is called an interval t-coloring if all the colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. For an edge coloring a and a vertex v the set of all the colors of the incident edges of v is called the spectrum of that vertex in a and is denoted by Sa(v). We consider the case where the spectrum for each vertex v is provided S(v), and the problem is to find an edge-coloring a such that for every vertex v, Sa(v)=S(v). We provide an O(N) algorithm that finds such an edge-coloring for trees that satisfies all the restrictions. If it is impossible to have an edge-coloring that satisfies the restrictions of the spectrums the algorithm will tell that too.