Equitable coloring of graphs. Recent theoretical results and new practical algorithms

被引：10

作者：

Furmanczyk, Hanna ^{[1
]}

Jastrzebski, Andrzej ^{[2
]}

Kubale, Marek ^{[2
]}

机构：

[1] Gdansk Univ Technol, Inst Informat, Wita Stwosza 57, PL-80952 Gdansk, Poland

[2] Gdansk Univ Technol, Dept Algorithms & Syst Modeling, Narutowicza 11-12, PL-80233 Gdansk, Poland

来源：

ARCHIVES OF CONTROL SCIENCES | 2016年 / 26卷 / 03期

关键词：

computer experiments; corona graph; equitable chromatic number; equitable coloring conjectures; NP-hardness; polynomial heuristics; PLANAR GRAPHS; MAXIMUM DEGREE; SHORT CYCLES; PRODUCTS;

D O I：

10.1515/acsc-2016-0016

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.

引用

页码：281 / 295

页数：15

共 15 条

[1] SOME NEW RESULTS ON EQUITABLE COLORING PARAMETERS OF GRAPHS
Sudev, N. K.
ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2020, 89 (01): : 109 - 122
[2] Hardness and algorithms of equitable tree-coloring problem in chordal graphs
Niu, Bei
Li, Bi
Zhang, Xin
THEORETICAL COMPUTER SCIENCE, 2021, 857 : 8 - 15
[3] Some New Results on δ(k) -Coloring of Graphs
Ellumkalayil M.T.
Samuel L.C.
Naduvath S.
Journal of Interconnection Networks, 2023, 23 (03)
[4] New Results on Edge-Coloring and Total-Coloring of Split Graphs
da Costa, Diego Amaro Ferraz
Couto, Fernanda
Klein, Sulamita
SSRN,
[5] SOME NEW RESULTS ON b-COLORING OF GRAPHS
Vaidya, Samir K.
Shukla, Minal S.
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2015, 16 (01): : 1 - 12
[6] New results in t-tone coloring of graphs
Cranston, Daniel W.
Kim, Jaehoon
Kinnersley, William B.
ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (02):
[7] New Linear-Time Algorithms for Edge-Coloring Planar Graphs
Richard Cole
Łukasz Kowalik
Algorithmica, 2008, 50 : 351 - 368
[8] New linear-time algorithms for edge-coloring planar graphs
Cole, Richard
Kowalik, Lukasz
ALGORITHMICA, 2008, 50 (03) : 351 - 368
[9] USING DUAL APPROXIMATION ALGORITHMS FOR SCHEDULING PROBLEMS - THEORETICAL AND PRACTICAL RESULTS
HOCHBAUM, DS
SHMOYS, DB
JOURNAL OF THE ACM, 1987, 34 (01) : 144 - 162
[10] Theoretical and Practical Results on Straight Skeletons of Planar Straight-Line Graphs
Huber, Stefan
Held, Martin
COMPUTATIONAL GEOMETRY (SCG 11), 2011, : 171 - 178

← 1 2 →