Henceforth, we identify a fullerene with its corresponding planar graph representation ... While growth algorithms are efficient for generating fullerenes with a small number of vertices (n ≤ 400), ...