A heuristic algorithm for the determination of the chromatic number of a finite graph is presented. This algorithm is based on Zykov’s theorem for chromatic polynomials, and extensive empirical tests show that it is the best algorithm available. Christofides’ algorithm for the determination of chromatic number is described and is used in the comparison tests.
No takes yet. Share an insight, caveat, or question.
Corneil et al. (1973) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: