An algorithm for calculating this quantity, unrelated  to the traveling salesman problem, was developed by Nicos Christofides, while the Brelaz DSATUR  heuristic is also used to calculate this quantity, though it does not guarantee minimality.
Culberson and Luo developed the MAXIS algorithm to calculate this quantity, which works by dividing  the target domain into maximal y independent sets. An algorithm for calculating this quantity, unrelated  to the traveling salesman problem, was developed by Nicos Christofides, while the Brelaz DSATUR  heuristic is also used to calculate this quantity, though it does not guarantee minimality. A theorem  which gives the upper bound of this quantity as either the maximum degree delta, or one plus delta, was  proven by Brooks, while Konig's theorem sets this quantity equal to or less than two if the corresponding  structure has no odd cycles. According to a theorem proved by Appel and Haken, this quantity is equal to  four for a plane separated into contiguous regions. For 10 points, identify this quantity which represents  the smal est number of distinct colors needed to color a graph so that no two vertices have the same  color.
Culberson and Luo developed the MAXIS algorithm to calculate this quantity, which works by dividing  the target domain into maximal y independent sets.
chromatic number [prompt on “gamma” I guess]