Search Results for ""

The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...

1. A fixed polyomino. 2. The set of points obtained by taking the centers of a fixed polyomino.

The 4-polyhex illustrated above (Gardner 1978, p. 147).

A polyhex consisting of hexagons arranged along a line.

A polyiamond consisting of equilateral triangles arranged along a line.

The 4-polyhex illustrated above.

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

The 6-polyiamond illustrated above.

The 6-polyiamond illustrated above.

The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...