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

Average Value of a Function
Select an object for a time to start a command. Light
bewijs stelling van Pythagoras
Neuberg's Theorem
Visualizing the Pythagorean Identity with Sine and Cosine

Découvrir des ressources

Solhøjden
Circular Motion Demo
kordinat kartesius
Geometric Constructions Formative Assessment
Zip line

Découvrir des Thèmes

Droite Sécante ou Sécante
Equation Différentielle
Angles
Triangles Rectangles
Cercle Inscrit ou Circonscrit