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

Graphing 1 + cos(θ) in Polar Coordinates
Polar Coordinates Book
दुई-ओटा समुहको संयोजन (Union of two sets)
Tangent in Cartesian and Polar Coordinates
z`]]

Discover Resources

CCGPS CA 4.3.3 Example 1
Invariance of a triangle's area
Algebra 1 with Geometry
The Centroid Mayerly Ospina
Incenter

Discover Topics

Tree Diagrams
Random Experiments
Statistics
Variance
Vectors 3D (Three-Dimensional)