Geodesic
On a form of coloring of graph edges into prescribed colors
Diskretnaya Matematika, Tome 9 (1997) no. 4, pp. 92-93.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider assignments of colours from given sets to the edges of a graph such that all edges of one and the same colour form a connected graph. For a forest consisting of trees with even numbers of edges we give a condition sufficient for existence of such a colouring. 
@article{DM_1997_9_4_a8,
     author = {O. P. Stetsenko},
     title = {On a form of coloring of graph edges into prescribed colors},
     journal = {Diskretnaya Matematika},
     pages = {92--93},
     publisher = {mathdoc},
     volume = {9},
     number = {4},
     year = {1997},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1997_9_4_a8/}
}
TY  - JOUR
AU  - O. P. Stetsenko
TI  - On a form of coloring of graph edges into prescribed colors
JO  - Diskretnaya Matematika
PY  - 1997
SP  - 92
EP  - 93
VL  - 9
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1997_9_4_a8/
LA  - ru
ID  - DM_1997_9_4_a8
ER  - 
%0 Journal Article
%A O. P. Stetsenko
%T On a form of coloring of graph edges into prescribed colors
%J Diskretnaya Matematika
%D 1997
%P 92-93
%V 9
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1997_9_4_a8/
%G ru
%F DM_1997_9_4_a8
O. P. Stetsenko. On a form of coloring of graph edges into prescribed colors. Diskretnaya Matematika, Tome 9 (1997) no. 4, pp. 92-93. http://geodesic.mathdoc.fr/item/DM_1997_9_4_a8/