Download citation
Download citation
link to html
An elementary method is described for finding the coordination sequences for a tiling, based on coloring the underlying graph. The first application is to the two kinds of vertices (tetravalent and trivalent) in the Cairo (or dual- tiling. The coordination sequence for a tetravalent vertex turns out, surprisingly, to be 1, 4, 8, 12, 16, …, the same as for a vertex in the familiar square (or 44) tiling. The authors thought that such a simple fact should have a simple proof, and this article is the result. The method is also used to obtain coordination sequences for the,, 4.82, 3.122 and 34.6 uniform tilings, and the snub-632 tiling. In several cases the results provide proofs for previously conjectured formulas.

Follow Acta Cryst. A
Sign up for e-alerts
Follow Acta Cryst. on Twitter
Follow us on facebook
Sign up for RSS feeds