Algorithm for Construction of Smallest Multiple Coronoids

The following algorithm represents a tentative method to construct one or more nonisomorphic smallest coronoids with a given viz. systems with h = h g). 

Consider the extremal benzenoid(s) with g hexagons. By definition they have the maximum number of internal vertices for the given say Here (Harary and 

Inspect the extremal benzenoid(s) with a given g for the numbers of parallel edges, say P. In general there are three directions to be inspected for every system, but one or two of the directions may be equivalent by virtue of symmetry. Detect the minimum value, viz. 

for a smallest coronoid with g holes it is conjectured that 

In order to depict (one of) the smallest coronoid(s) with g holes (a) select an extremal benzenoid with P = and draw it so that the parallel edges are horizontal (b) convert each hexagon of this benzenoid into a naphthalene corona hole according to  

---