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 closeto 
, 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.
- Mackey's Theorem
- Mac Lane's Theorem
- Maclaurin-Bezout Theorem
- Maclaurin-Cauchy Theorem
- Maclaurin Integral Test
- Maclaurin Polynomial
- Maclaurin Series
- Maclaurin Trisectrix
- Maclaurin Trisectrix Inverse Curve
- MacMahon's Prime Number of Measurement
- MacRobert's E-Function
- Madelung Constants
- Maeder's Owl Minimal Surface
- Maehly's Procedure
- Magic Circles
- Magic Constant
- Magic Cube
- Magic Geometric Constants
- Magic Graph
- Magic Hexagon
- Magic Labeling
- Magic Number
- Magic Series
- Magic Square
- Magic Star