On the number of hexagonal polyominoes

DOI10.1016/S0304-3975(03)00229-9zbMath1053.05028WikidataQ63044141 ScholiaQ63044141MaRDI QIDQ1885027

Anthony J. Guttmann, Markus Vöge

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

EnumerationPolyominoesTriangular latticeHexagonal latticeSite clusters

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Polyominoes (05B50)

Related Items (5)

COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES ⋮ Enumeration of various animals on the triangular lattice ⋮ Exactly Solved Models ⋮ Exact Enumerations ⋮ Appendix: Series Data and Growth Constant, Amplitude and Exponent Estimates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting lattice animals: A parallel attack
• A pattern theorem for lattice clusters
• A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
• Critical Behavior of Branched Polymers and the Lee-Yang Edge Singularity
• Animals, Trees and Renewal Sequences
• Statistics of lattice animals (polyominoes) and polygons
• Polygonal polyominoes on the square lattice
• Self-avoiding polygons on the square lattice
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• On the Number of Self-Avoiding Walks

This page was built for publication: On the number of hexagonal polyominoes