INTERVAL EDGE COLORING OF TREES WITH STRICT RESTRICTIONS ON THE SPECTRUMS
Open Access
- 15 June 2021
- journal article
- Published by RS Global Sp. z O.O. in Science Review
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Interval Vertex-Coloring of a Graph With Forbidden ColorsPublished by Elsevier BV ,1989
- Generalized 1-factorization of treesDiscrete Mathematics, 1981
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955