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

Example of using color palette
Proving Triangles Congruent (2): Multi-Step Transformations
Rolle's Theorem
Mean Value Theorem
apec

Discover Resources

Project 2
Sine & Cosine Graphs
Lagrange multiplier example
Butterfly

Discover Topics

Statistics
Means
Exponential Functions
Derivative
Symmetry