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

Nieuw didactisch materiaal

Regular Polygons and Equivalent Triangles
bewijs stelling van Pythagoras
Building Trapezoids with Set Areas
Mondrian's Puzzle
Building Triangles with Set Areas

Ontdek materiaal

Rotation Tessellation Triangle Step 10
The Normal Distribution
Bagels or Donuts - A Balanced Assessment Task
Výkon - vztah 1 - rozklad na činnou a jalovou složku
Reduction to acute angle of trigonometric functions

Ontdek onderwerpen

Lineaire Regressie
Differentiaalvergelijking
Complexe getallen
Raaklijn
Optelling