Computes the Kaszonyi function values for every edge of given graphs according to the definition by M.Zubčák in his bachelor thesis. For graphs that are not 3-edge-colorable the values is three times ...

This function recursively applies transformations to enumerate prime cubic graphs starting from the K4 graph. It calls relevant functions to check the irreducibility of edges and manage duplicates.