plantri

Plantri is a program that generates certain types of graphs that are imbedded on the sphere. Exactly one member of each isomorphism class is output, using an amount of memory almost independent of the number of graphs produced. This, together with the exceptionally fast operation and careful validation, makes the program suitable for processing very large numbers of graphs. Isomorphisms are defined with respect to the embeddings, so in some cases outputs may be isomorphic as abstract graphs.

homepage: https://doc.sagemath.org/html/en/reference/spkg/plantri.html

version	toolchain
5.4	GCCcore/13.2.0

(quick links: (all) - 0 - a - b - c - d - e - f - g - h - i - j - k - l - m - n - o - p - q - r - s - t - u - v - w - x - y - z)