This article is cited in 3 papers

System Analysis and Operations Research

On interval $\Delta$-coloring of bipartite graphs

T. A. Magomedov

Dagestan State University, Makhachkala, Russia

Abstract: There exists an important class of problems where the minimal-length scheduling comes to regular coloring of a bipartite graph with the least possible number of colors, and the scheduling without downtimes, to the interval coloring of a bipartite graph. Consideration was given to the problem of interval $\Delta$-coloring of the bipartite multigraph. An example was built of the $(6,3)$-biregular graph having no interval $\Delta$-coloring.

Presented by the member of Editorial Board: A. A. Lazarev

Received: 18.01.2012

 English version: Automation and Remote Control, 2015, 76:1, 80–87

Bibliographic databases:

• 
• 
• 
•