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.
- Yff Triangles
- y-Intercept
- Yin-Yang
- Young Diagram
- Young Girl-Old Woman Illusion
- Young Inequality
- Young's Integral
- Young Tableau
- Z
- Z-
- Z+
- Z*
- Zag Number
- Zarankiewicz's Conjecture
- Zariski Topology
- Zaslavskii Map
- Zassenhaus-Berlekamp Algorithm
- z-Axis
- z-Distribution
- Zeckendorf Representation
- Zeckendorf's Theorem
- Zeeman's Paradox
- Zeilberger's Algorithm
- Zeisel Number
- Zeno's Paradoxes