Assertion list
connected graph (subgroup of graph ) → CapableOf
Results from Ascent++: 1
connected graph → CapableOf → contain at most two cycles 0.84