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

Noisy loop
Vectors and Components
z`]]
Spherical dodecahedron/icosahedron
Vectors and Components - Trig

Discover Resources

Mirror Writing
Forum_36838_C_intersect
Parabolas Conics Horizonatl with Directrix, focus, latus
Piecewise 3
funciones con sen y cos
Trig Revision 2 1(c)

Discover Topics

Kite
Functions
Power Functions
Calculus
Inequalities