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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2016-09-01
|
| Series: | Archives of Control Sciences |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/acsc.2016.26.issue-3/acsc-2016-0016/acsc-2016-0016.xml?format=INT |