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

Nieuw didactisch materiaal

Reflection across a line
Volume by Shells Around y
Making New Year's resolutions for 2026
Using Experimental Probability to Estimate π - Monte Carlo Method
Exploring GeoGebra for the First Time

Ontdek materiaal

Triangle Angles Exploration
testAngle
Cantor Dust (4th Level)
Making Similar Triangles
RHS tri - CUEBA0091
Translation and scaling

Ontdek onderwerpen

Ongelijkzijdige driehoeken
Normaalverdeling
Integraalrekenen
Vierkant
Cosinus