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

Matrices - Basic Terminology
Subtracting Hours and Minutes - Practice
Conditions for Parallel Lines
Vectors: Scalar Multiplication
Measuring Cup

Découvrir des ressources

Hexagon inscribed in a circle
Property 6
slider 2
moments diagram
Drawing a Square in Circle

Découvrir des Thèmes

Soustraction
Pavé Droit
Exposant
Addition
Test d'Hypothèse