Tag Archives: radlams

Proof of radlam Classification

Enough talk, let’s do some math. Sketch of proof of the classification theorem given in The Graph Type of a Polyomino. (I defined radlams in the post Raldams.): First we need some lemmas on how radlams decompose. Lemma 1 (the … Continue reading

Posted in polyominoes | Tagged , , , , | Leave a comment

The Graph type of a Polyomino

This is a continuation of the post radlams. A graph is some dots (called nodes or vertices) and lines between some of them (called edges). It’s not the geometry of the graph that matters, just how the vertices are connected … Continue reading

Posted in polyominoes | Tagged , , , | 2 Comments

Radlams

There are five tetrominoes: All but one of them decompose into two dominoes: For the T, no matter which domino you remove, you are left with a pair of monominoes: There are 12 pentominoes: All but one of them decomposes … Continue reading

Posted in polyominoes | Tagged , , , , | 1 Comment