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

Nouvelles ressources

רישום חופשי
函數的奇偶性
Area Between Two Curves
random coprime pairs
bewijs stelling van Pythagoras

Découvrir des ressources

M4 90 rotations
Parabola explorer
Absolute Value
BPW Inv 1.1 - Line Reflections
Bewys van die stelling

Découvrir des Thèmes

Nombres
Nuage de Points
Sphère
Mode
Vecteurs 2D (dans le Plan)