The Thesis algorithm uses partial-differential edge operators and a grammatical structure to generate andavoid expanding the Matching Polynomial. To run the algorithm efficiently, the vertexes of fullerene graphsC60-100 were sorted into three-dimensional sectors.