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

Quiz: Vertical Angles and Linear Pairs
Drunk Parabola
Traffic Cone
Graphical solution of ax² + bx + c = k
apec

Descubrir recursos

Fox game challenge 2
Graph 2 w functions
Translation-6
Chebyshev Norm
Acute Triangle
Nested radicals and binary trigonometry

Descubre temas

Prisma
Volumen
Cuadrado
Triángulos Equiláteros
Matrices