Opening book details…
Can I read On a Type of Assigning a Colour from Given Sets to the Edges of a Graph on EtoBox?
On a Type of Assigning a Colour from Given Sets to the Edges of a Graph by O. P. STETSENKO is a Computer Science article available to read on EtoBox.
What is On a Type of Assigning a Colour from Given Sets to the Edges of a Graph about?
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. We consider an arbitrary graph G with n edges. Let each edge / be associated with a nonempty set of colours S/, / = 1,..., n. Colouring the edges of the graph G the prescribed colours means that one of the colours from 5, is assigned to each edge /, / = 1,..., n. We say that the colouring is regular if all edges of one and the same colour form a connected graph.
Who reads On a Type of Assigning a Colour from Given Sets to the Edges of a Graph?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- O. P. STETSENKO
- Publisher
- Walter de Gruyter GmbH & Co. KG; Walter de Gruyter GmbH (ISSN 0924-9265)
- Published
- 1997
- Language
- EN
- Field
- Computer Science (Physical Sciences)