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

Building Triangles with Set Areas
Damped Trochoidal Curve
רישום חופשי
bewijs stelling van Pythagoras
Conway Circle Theorem

Descubrir recursos

Limit e&d Definition
Parallel Lines cut by a Transversal
golden ratio
Folding: Investigating Lines of Symmetry
Congruent triangle

Descubre temas

Funciones Logarítmicas
Cilindro
Puntos Notables
Operaciones Aritméticas
Cuadriláteros en general