Geodesic
On edge muticoloring of unicyclic graphs
Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 3, pp. 76-81 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A muticoloring of an edge weighted graph is an assignment of intervals to its edges such that the intervals of adjacent edges do not intersect in the inner points and the length of each interval is equal to the weight of the edge. The minimum length of the union of all intervals is the edge multichromatic number of the graph. The maximum weighted degree of the vertices (the sum of the weights of the edges incident to it) is its evident lower bound. The examples are known when the multichromatic number is 1.5 times as big as the lower bound. There is a conjecture that this ratio cannot excede 1.5. In the paper, this conjecture is proved for the class of unicyclic graphs. Bibliogr. 4.
Keywords: edge coloring, muticoloring, weighted graphs, intervals, open shop problem. 
@article{DA_2014_21_3_a7,
     author = {A. V. Pyatkin},
     title = {On edge muticoloring of unicyclic graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {76--81},
     year = {2014},
     volume = {21},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2014_21_3_a7/}
}
TY  - JOUR
AU  - A. V. Pyatkin
TI  - On edge muticoloring of unicyclic graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2014
SP  - 76
EP  - 81
VL  - 21
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DA_2014_21_3_a7/
LA  - ru
ID  - DA_2014_21_3_a7
ER  - 
%0 Journal Article
%A A. V. Pyatkin
%T On edge muticoloring of unicyclic graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2014
%P 76-81
%V 21
%N 3
%U http://geodesic.mathdoc.fr/item/DA_2014_21_3_a7/
%G ru
%F DA_2014_21_3_a7
A. V. Pyatkin. On edge muticoloring of unicyclic graphs. Diskretnyj analiz i issledovanie operacij, Tome 21 (2014) no. 3, pp. 76-81. http://geodesic.mathdoc.fr/item/DA_2014_21_3_a7/

[1] Vizing V. G., “O multiraskraske vershin vzveshennykh grafov”, Diskret. analiz i issled. operatsii. Ser. 1, 14:4 (2007), 16–26 | MR | Zbl

[2] Vizing V. G., “Multicoloring the incidentors of a weighted undirected multigraph”, J. Appl. Industr. Math., 6:4 (2012), 514–521 | DOI | MR

[3] Shannon C. E., “A theorem on coloring the lines of a network”, J. Math. Phys., 28 (1949), 148–151 | MR | Zbl

[4] Woeginger G. J., “Open problems in the theory of scheduling”, Bull. EATCS, 76 (2002), 67–83 | MR