Hello, Given some graphs, I want to calculate the lengths of their shortest holes , i.e induced cycles with length at least four. Furthermore, a purpose is to filter out graphs containing k-holes, such as k=4. Currently, in Sage, is_subgraph(other, induced=True, up_to_isomorphism=True) can be used for filtering. Can Nauty itself do this? Best wishes, Licheng.