|
Algorithm for coloring edges of a simple graph
A. M. Magomedov Daghestan Scientific Centre of Russian Academy of Sciences
Abstract:
The algorithm checks the existence of bipartite graph edge-coloring such that at each vertex $v$ the colors presented at $v$ form a set of consecutive integers.
Keywords:
bipartite graph, set, algorithm, colors.
Received: 01.07.2016 Revised: 31.08.2016 Accepted: 01.09.2016
Citation:
A. M. Magomedov, “Algorithm for coloring edges of a simple graph”, Daghestan Electronic Mathematical Reports, 2016, no. 6, 25–30
Linking options:
https://www.mathnet.ru/eng/demr27 https://www.mathnet.ru/eng/demr/y2016/i6/p25
|
|