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.

UDC: 681.142.1

Received: 01.07.2016
Revised: 31.08.2016
Accepted: 01.09.2016

DOI: 10.31029/demr.6.2

Bibliographic databases:

•