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

Nuevos recursos

z`]]
Model sferyczny - sześcian-ośmiościan
Viviani's Curve
Trefoil Knot
Angle Addition: Warm Up Exercises

Descubrir recursos

Exploring Graphing Systems of Linear Equations
Start, Perpendicular to point on line
Justin's Rotations
LRAM RRAM TRAP
Simple linear function y = 2x+6

Descubre temas

Área
Conjuntos
Matrices
Planos
Diagramas de árbol