The Kekule structures of multiple phenylenes X(m,n) are enumerated. By
means of specially designed computational algorithms both the Kekule
structure count (K) and the algebraic structure count (A) of X(m,n) ar
e determined. For the first few values of n explicit combinatorial exp
ressions for K are deduced. It is verified that the recursion relation
A{X(m+2,n)} = (n+1) A{X(m+1,n)} - [n/2] [n/2] A{X(m,n)} holds for all
n greater than or equal to 1 and all m greater than or equal to 1.