Approximation theory

Daghestan Electronic Mathematical Reports: Issue 6 (2016)


Algorithm for coloring edges of a simple graph

UDK: 681.142.1

Pages: 25 - 30


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.




To issue content

Download full text