[Nauty-list] Cheap accept in geng

[Christian Desrosiers]

Hello everyone,

I'm trying to figure out the cheap accept rules of function accept2, without
success. For instance, why does it accept a graph G if the refined partition of
V(G) has a number of cells greater than |V(G)|-4 ? Same question for the other
cases. Is this something that was determined empirically, or can it be
explained simply ?

Thanks in advance,

Christian Desrosiers