Abstract
In many practical applications the underlying graph must be as equitable colored as possible. A coloring is called equitable if the sizes of any two color classes differ by at most one, and the least number of colors for which a graph has such a coloring is called its equitable chromatic number.We introduce a new integer linear programming approach for studying the equitable coloring number of a graph and show how to use it for improving lower bounds for this number. The two stage method is based on finding or upper bounding the maximum cardinality of an equitable color class in a valid equitable coloring and, then, sequentially improving the lower bound for the equitable coloring number.The computational experiments were carried out on DIMACS graphs and other graphs from the literature. The lower bounds were improved for more than half of the instances considered.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
