Author:
Furmańczyk Hanna,Jastrzębski Andrzej,Kubale Marek
Abstract
AbstractIn 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.
Subject
Control and Optimization,Modelling and Simulation,Control and Systems Engineering
Reference26 articles.
1. Equitable andm - bounded coloring of split graphs InCombinatorics and Computer Springer;Chen;Science,1120
2. Equitable list colorings of planar graphs without short cycles;Zhuand;Theoret Comput Sci,2008
3. Equitable coloring and the maximum degree;Chen;Combinatorics,1994
4. Problem In editor Theory of Graphs and its Applications;9;Czech Acad Sci Publ,1964
5. A short proof of the Hajnal - Szemeredi theorem on equitable colouring Probability and;Kiersteadand;Combinatorics Computing,2008
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献