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

Math Art Construction
Angles of Intersecting Lines
Triangle Flexer
רישום חופשי
Trefoil Knot

Discover Resources

Volume of a Sphere
Computer Algebra View (CAS)
orthocenter
Form 5 Chapter 8 - Locus - Case 3
Circle1

Discover Topics

Straight Lines
Rhombus
Hypergeometric Distribution
Parallelogram
Statistics