Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms

Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms

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...

Full description

Bibliographic Details
Main Authors: Furmańczyk Hanna, Jastrzębski Andrzej, Kubale Marek
Format: Article
Language:English
Published: Polish Academy of Sciences 2016-09-01
Series:Archives of Control Sciences
Subjects:
computer experiments
corona graph
equitable chromatic number
equitable coloring conjectures
NP-hardness
polynomial heuristics
Online Access:http://www.degruyter.com/view/j/acsc.2016.26.issue-3/acsc-2016-0016/acsc-2016-0016.xml?format=INT
Description
Summary: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.
ISSN:2300-2611

Similar Items