Abstract
We propose a new exact algorithm for finding the chromatic number of a graph G . The algorithm attempts to determine the smallest possible induced subgraph G' of G which has the same chromatic number as G . Such a subgraph is said critical since all proper induced sub-graph of G' have a chromatic number strictly smaller than G' .The proposed method is particularly helpful when a k -coloring of a non-critical graph is known, and it has to be proved that no ( k -1)-coloring of G exists. Computational experiments on random graphs and on DIMACS benchmark problems demonstate that the new proposed algorithm can solve larger problem than previous known exact methods.
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.
