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)
רישום חופשי
Geometric linkage
Function Machine
Kite Function Art

Discover Resources

Find Area
Untitled
Rotation of a Point by an Angle
Problem Set #4

Discover Topics

Scatter Plot
Bar Chart or Bar Graph
Sine
Numbers
Prism