Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

被引：8
|
作者：
Furmanczyk, Hanna [1 ]
Kubale, Marek [2 ]
机构：
[1] Univ Gdansk, Inst Informat, Wita Stwosza 57, PL-80952 Gdansk, Poland
[2] Gdansk Univ Technol, Dept Algorithms & Syst Modeling, PL-80233 Gdansk, Poland
来源：
ARCHIVES OF CONTROL SCIENCES | 2015年 / 25卷 / 01期
关键词：
batch scheduling; equitable coloring; semi-equitable coloring; cubic graph;
D O I：
10.1515/acsc-2015-0007
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：109 / 116
页数：8
相关论文
共 50 条
  • [31] Equitable Coloring of Some Convex Polytope Graphs
    Manikandan K.
    Harikrishnan T.
    International Journal of Applied and Computational Mathematics, 2018, 4 (5)
  • [32] ON r-EQUITABLE COLORING OF COMPLETE MULTIPARTITE GRAPHS
    Yen, Chih-Hung
    TAIWANESE JOURNAL OF MATHEMATICS, 2013, 17 (03): : 991 - 998
  • [33] Equitable Total Coloring of Graphs with Maximum Degree 3
    Wei-Fan Wang
    Graphs and Combinatorics, 2002, 18 : 677 - 685
  • [34] (N, p)-equitable b-coloring of graphs
    Taleb, Samiha Ait
    Slimani, Hachem
    Kheddouci, Hamamache
    DISCRETE APPLIED MATHEMATICS, 2018, 235 : 1 - 15
  • [35] On the equitable total chromatic number of cubic graphs
    Dantas, S.
    de Figueiredo, C. M. H.
    Mazzuoccolo, G.
    Preissmann, M.
    dos Santos, V. F.
    Sasaki, D.
    DISCRETE APPLIED MATHEMATICS, 2016, 209 : 84 - 91
  • [36] Equitable Dominator Coloring of Helm-Related Graphs
    George, Phebe Sarah
    Madhumitha, S.
    Naduvath, Sudev
    JOURNAL OF INTERCONNECTION NETWORKS, 2025,
  • [37] Equitable Coloring of Complete r-partite Graphs
    WANG Xiu-mei(Department of Mathematics
    数学季刊, 2004, (04) : 412 - 415
  • [38] On the vertex distinguishing equitable edge-coloring of graphs
    Zhang, Zhong-fu
    Li, Mu-chun
    Yao, Bing
    Xu, Bo-gen
    Wang, Zhi-wen
    Li, Jing-wen
    ARS COMBINATORIA, 2008, 86 : 193 - 200
  • [39] SOME NEW RESULTS ON EQUITABLE COLORING PARAMETERS OF GRAPHS
    Sudev, N. K.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2020, 89 (01): : 109 - 122
  • [40] Equitable and m-bounded coloring of split graphs
    Chen, B.-L.
    Ko, M.-T.
    Lih, K.-W.
    Lecture Notes in Computer Science, 1120
12345