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

Dividing a 3-digit number by a 1-digit number (2)
bewijs stelling van Pythagoras
Dilation + Rotation of Pentagons
Torus
functionartculture

Discover Resources

Basic Sine, Cosine, and Tangent Introduction
Eigenvalues
Chi Squared 3
Progresiones Geométricas
Perpendicular bisector
هرم

Discover Topics

Centroid or Barycenter
Sphere
Definite Integral
Symmetry
Angles