|
This article is cited in 1 scientific paper (total in 1 paper)
On a form of coloring of graph edges into prescribed colors
O. P. Stetsenko
Abstract:
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.
Received: 14.12.1995
Citation:
O. P. Stetsenko, “On a form of coloring of graph edges into prescribed colors”, Diskr. Mat., 9:4 (1997), 92–93; Discrete Math. Appl., 7:6 (1997), 643–644
Linking options:
https://www.mathnet.ru/eng/dm504https://doi.org/10.4213/dm504 https://www.mathnet.ru/eng/dm/v9/i4/p92
|
Statistics & downloads: |
Abstract page: | 777 | Full-text PDF : | 284 | First page: | 6 |
|