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

Intersections of y=a^x and y=log(a, x)
bewijs stelling van Pythagoras
רישום חופשי
The 3D Space
seo tool

Descubrir recursos

Lines in space
Spinning Earth
نظرية مركز الدائره الخارجية
Дифференциал тэгшитгэлийн шийдийн утгыг тайлбарлах
Homothetic polygons in circle

Descubre temas

Función potencial
Correlación
Experimentos aleatorios
Transformaciones Geométricas
Funciones Polinómicas