### Blog Carnivals

### Blogs I Follow

### Meta

### Blogroll

### Categories

### Tags

addition algebra art autumn base ten biology blocks books botany braids calculus children combinatorics counting dominoes ecology elementary education engineering fall flexagons geometry graphs graph theory hickory infinity integers kids kindergarten knots knot theory large numbers leaf leaves links loops math math books math education mathematical knots mathematics mathematics education math puzzles maths math with paper math with scissors math with tape multiplication natural history nature numbers number theory origami parabola parabolas partitions partitions of graphs pentominoes plants polyominoes pop culture pop math puzzle puzzles Python radlams rationals recreational math recreational mathematics science scissors sentences shutdown sudoku tape topology

# Tag Archives: graph theory

## Partitions of Graphs XI: The Case of all Sufficiently Large n

This the eleventh in a series, the first being found here: Part 1, and the previous here Part 10. In this post I provide examples of Q1 graphs of all orders n, for sufficiently large n. In particular this will … Continue reading

## Partitions of Graphs X: The Case of Composite Integers

This is the tenth in a series, the first being found here: Part 1, and the previous here: Part 9. In this post I introduce a family of graphs that provides examples of Q1 graphs for all composite orders. If … Continue reading

## Partitions of Graphs IX: The case of 13

This is the ninth in a series, the first being here: Part 1, and the previous here: Part 8. Here is a Q1 graph for n=13 o / o-o-o-o-o-o-o-o-o-o \ o-o The corresponding Q1 partition is 5+5+3. Unfortunately this … Continue reading

## Partitions of Graphs VIII: The case of 11 (and 17)

This is the eighth in a series, the first being here: Part I and the previous here: Part 7. We have shown that there are no Q1 graphs with n=5 nodes or with n=7 nodes. Also, in the case of … Continue reading

## Partitions of Graphs VII: The Cases of 5 and 7

This is the seventh in a series, the first being here: Part I, the previous here: Part VI. In the previous post I defined a Q1 graph to be a graph G with q(G)=1. We found examples of Q1 graphs … Continue reading

## Partitions of Graphs VI: Q1 Graphs

This is the sixth in a series. The first is found here: Part I. The previous is found here: Part V. I have defined q(G) to be: q(G) = p(n) – p(G), where n is the number of nodes in G. … Continue reading

## 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 graph theory, graphs, polyomino decompositions, polyominoes, radlams
Leave a comment