Allowed boundary sequences for fused polycyclic patches and related algorithmic problems.
We consider sequences that encode boundary circuits of fused polycycles made up of polygonal faces with p sides, p < or = 6. We give a constructive algorithm for recognizing such sequences when p = 5 or 6. A simpler algorithm is given for planar hexagonal sequences. Hexagonal and pentagonal sequences of length at most 8 are tabulated, the former corresponding to planar benzenoid hydrocarbons CxHy with y up to 14.
Deza
M
M
Department of Mathematics and Informatics, Ecole Normale Supérieure, Paris, France. michel.deza@ens.fr
Fowler
P W
PW
Grishukhin
V
V