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 of equitable coloring problem. Next, since the general… (More)

5 Figures and Tables


  • Presentations referencing similar topics