|
Avtomatika i Telemekhanika, 2015, Issue 1, Pages 101–109
(Mi at14176)
|
|
|
|
This article is cited in 3 scientific papers (total 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.
Citation:
T. A. Magomedov, “On interval $\Delta$-coloring of bipartite graphs”, Avtomat. i Telemekh., 2015, no. 1, 101–109; Autom. Remote Control, 76:1 (2015), 80–87
Linking options:
https://www.mathnet.ru/eng/at14176 https://www.mathnet.ru/eng/at/y2015/i1/p101
|
Statistics & downloads: |
Abstract page: | 204 | Full-text PDF : | 95 | References: | 36 | First page: | 17 |
|