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

Vector Projections
Function Machine
Learn to Prove: Kite
Untitled
Fraction Subtraction

Discover Resources

Area Between Two Functions
A square is a rombus
Two Centers of Dilation
Question 2, demonstration 1
Happy Holidays

Discover Topics

Geometric Distribution
Rectangle
Integral Calculus
Stochastic Process or Random Process
Similarity Transformation or Similarity