Multicoloring of incidentors of weighted undirected multigraph

Undirected multigraphs with weighted edges are considered. In multicoloring of incidentors, every incidentor should be assigned with a multicolor, i.e. an interval of colors whose length is equal to the weight of the incidentor. A multicoloring is proper if the multicolors of any two adjacent or junction incidentors do not intersect. Upper and lower bounds for the minimum number of colors necessary for a proper multicoloring of all incidentors of a multigraph are presented. Ill. 1, bibliogr. 10.