The enumeration of tree-like polyhexes

Abstract

A problem of considerable interest in combinatorial analysis is that of determining the number of ways in which a connected figure can be constructed in the plane by assembling n regular hexagons in such a way that two hexagons abut on each other, if at all, along the whole of a common edge. Examples of these constructions can be seen in the various figures in this paper.