Theorem. Chromatic Polynomial

THEOREM

Let G be a simple graph, v and w — not adjacent vertices. Let G₊ obtained from G by connecting v and w, and graph G₌ — by combining vertices v and w in one. Then

New Resources

Exploring GeoGebra for the First Time
Using Experimental Probability to Estimate π - Monte Carlo Method
גיליון אלקטרוני להעלאת נתוני בעיה ויצירת גרף בהתאם
bewijs stelling van Pythagoras
Equation of Locus - Parabola

Discover Resources

Tiling
Area of a Circle (III)
sine graph
Yr 8 Translation
Eenheidscirkel

Discover Topics

Trigonometry
Trigonometric Functions
Sphere
Pyramid
Histogram