The enumeration of tree-like polyhexes
- 1 June 1970
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- Vol. 17 (1) , 1-13
- https://doi.org/10.1017/s0013091500009135
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 assemblingnregular 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.Keywords
This publication has 10 references indexed in Scilit:
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Chemical graphs—VTetrahedron, 1968
- Some Results Concerning PolyominoesThe Fibonacci Quarterly, 1965
- Dissimilarity characteristic theorems for graphsProceedings of the American Mathematical Society, 1960
- Dissimilarity Characteristic Theorems for GraphsProceedings of the American Mathematical Society, 1960
- The number of homeomorphically irreducible trees, and other speciesActa Mathematica, 1959
- The Number of Linear, Directed, Rooted, and Connected GraphsTransactions of the American Mathematical Society, 1955
- The number of linear, directed, rooted, and connected graphsTransactions of the American Mathematical Society, 1955
- The Number of TreesAnnals of Mathematics, 1948
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische VerbindungenActa Mathematica, 1937