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

Model sferyczny - dwunastościan-dwudziestościan
Viviani's Curve
Slope and Road Signs
Damped Trochoidal Curve
רישום חופשי

Discover Resources

Chaos Game
MoringHubart-Locus
Modul 7 (TRANSLASI)_TAUFIK ALBAR_SMPN 2 MODUNG BANGKALAN
Reflection about Line - Visualization
Window Guided by a Segment

Discover Topics

Pyramid
Trigonometry
Difference and Slope
Intersection
Power Functions