Proposition 9.3 as printed (Definition 9.1)                                        n=6: 112 (connected 68)   n=7: 758 (connected 567)
V1: 2|I| = m also allowed in Lambda_{m,I}                                          n=6: 112 (connected 68)   n=7: 759 (connected 568)
V2: consecutive vertices allowed in I                                              n=6: 112 (connected 68)   n=7: 759 (connected 568)
V3: prism allowed as a block of clique-sums (as if its system were pointed)        n=6: 112 (connected 68)   n=7: 762 (connected 571)
V4: several true twins of the same vertex allowed in kind (d)                      n=6: 112 (connected 68)   n=7: 759 (connected 568)
V5: K_0 may have isolated vertices                                                 n=6: 112 (connected 68)   n=7: 758 (connected 567)
V6: T without closure under true twins (Prop. 8.1 not used inside clique-sums)     n=6: 110 (connected 66)   n=7: 679 (connected 490)
V7: T without the graphs Lambda_{m,I} (Prop. 8.5 not used)                         n=6: 110 (connected 66)   n=7: 716 (connected 527)
V8: without the prism (Theorem 8.7 not used)                                       n=6: 111 (connected 67)   n=7: 755 (connected 565)
V9: kind (d) without true twins of Gamma (Prop. 8.3 not used)                      n=6: 111 (connected 67)   n=7: 692 (connected 502)
literal union of Thm 1.5 and Thm 1.6(1)-(3) (no clique-sums after twins, connected only) n=6: 112 (connected 68)   n=7: 710 (connected 526)
the same, but components of the kind of Thm 1.6(3) allowed in disjoint unions      n=6: 112 (connected 68)   n=7: 717 (connected 526)
