Chromatic Polynomial

A Polynomial of a graph which counts the number of ways to color with exactly colors. Tutte (1970) showed that the chromatic Polynomials of planar triangular graphs possess a Root close to , where is the Golden Mean. More precisely, if is the number of Vertices of , then

(Le Lionnais 1983).

References

Le Lionnais, F. Les nombres remarquables. Paris: Hermann, p. 46, 1983.

Tutte, W. T. On Chromatic Polynomials and the Golden Ratio.'' J. Combin. Th. 9, 289-296, 1970.