In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP-complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize the makespan.
机构:
Arizona State Univ, Sch Math Sci & Stat, Tempe, AZ 85069 USAArizona State Univ, Sch Math Sci & Stat, Tempe, AZ 85069 USA
Kierstead, H. A.
Kostochka, A. V.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Illinois, Dept Math, Urbana, IL 61801 USA
Russian Acad Sci, Inst Math, Novosibirsk 630090, RussiaArizona State Univ, Sch Math Sci & Stat, Tempe, AZ 85069 USA