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

Rose Curve
Trefoil Knot
Damped Trochoidal Curve
Random Polar Curve (3)
רישום חופשי

Découvrir des ressources

Efficient Markets maximize Total Surplus
Hexagonal Prism
notes
Circle-Sphere
Triangle Inequality

Découvrir des Thèmes

Fonctions en Escalier
Rotation
Valeur Attendue
Cercle Unité
Sinus