This work is licensed under Creative Commons Attribution–NonCommercial International License
(CC BY-NC 4.0).
An interval vertex-coloring of a graph G is a coloring of the vertices of the graph with intervals of integers such that the intervals of any two adjacent vertices do not intersect. In this paper we consider the case, where for each vertex v there is a length l(v) and a set of colors S(v), from which the colors should be and it is required to find an interval vertex-coloring γ such that for each vertex v the restrictions are met, i.e. |γ(v)|=l(v),γ(v)⊆S(v). We will provide a pseudo-polynomial algorithm for cactus graphs. If it is impossible to have an interval vertex-coloring that satisfies all the restrictions, then the algorithm will tell that as well.