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

Nowe zasoby

Limaçons
Slope Between 2 Points (Phase 2)
bewijs stelling van Pythagoras
Rule of Sarrus - Determinant of a 3×3 Matrix
Fractal Tétraèdre. Dilatation -1/2 centre triangles

Odkryj zasoby

Rectangles with fixed perimeter
papier log
Riemann Sum
Measurement of Rotation
Construction of an Isosceles Triangle

Odkryj tematy

Walec
Conic Sections
Przekształcenia geometryczne
Pierwiastek
Liczby naturalne