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

Mondrian's Puzzle
Slope Between 2 Points (Phase 2)
Area of a Trapezoid
Regular Star Polygons
Parallelogram Anatomy

Descubrir recursos

Example 3
Cyclic Quadrilateral Opposite Angles
Scenario #1
parallelograms: Discovery Labs
H2M 2018 P2 Q3

Descubre temas

Pitágoras o Teorema de Pitágoras
Logaritmo
Medias
Vectores 3D (tres dimensiones)
Trapecio