satisfy Prop. 9.3, not Thm 1.5, and not of the form of Thm 1.6(3): 48 (connected: 41)
  Gamma edges 02 03 04 06 12 14 15 23            connected=True isolated=0 : (d): complement of K0 has edges [01 05 13 16 24 25 26 34 35 36 45 46 56] = in T (clique-sum involving twins or Lambda_{m,I}); true twins 0
  Gamma edges 01 05 06 13 14 15 23 24            connected=True isolated=0 : (d): complement of K0 has edges [02 03 04 12 16 25 26 34 35 36 45 46 56] = in T: true twin of a graph that is [in T (clique-sum involving twins or Lambda_{m,I})]; true twins 0
  Gamma edges 01 04 05 06 12 13 15 23 24         connected=True isolated=0 : (d): complement of K0 has edges [02 03 14 16 25 26 34 35 36 45 46 56] = in T (clique-sum involving twins or Lambda_{m,I}); true twins 0
  Gamma edges 03 04 05 06 12 13 15 23 24         connected=True isolated=0 : (d): complement of K0 has edges [01 02 14 16 25 26 34 35 36 45 46 56] = in T (clique-sum involving twins or Lambda_{m,I}); true twins 0
  Gamma edges 02 03 04 06 13 14 15 23 24         connected=True isolated=0 : (d): complement of K0 has edges [01 05 12 16 25 26 34 35 36 45 46 56] = in T: true twin of a graph that is [in T (clique-sum involving twins or Lambda_{m,I})]; true twins 0
  Gamma edges 01 03 05 06 13 14 15 23 24         connected=True isolated=0 : (d): complement of K0 has edges [02 04 12 16 25 26 34 35 36 45 46 56] = in T (clique-sum involving twins or Lambda_{m,I}); true twins 0
  Gamma edges 03 04 05 12 14 23                  connected=False isolated=1 : (d): complement of K0 has edges [01 02 13 15 24 25 34 35 45] = Lambda_{m,I} with m=5, |I|=1; true twins 0
  Gamma edges 02 04 05 14 15 23                  connected=False isolated=1 : (d): complement of K0 has edges [01 03 12 13 24 25 34 35 45] = in T: true twin of a graph that is [in K (clique-sum of complete graphs and cycles)]; true twins 0
  Gamma edges 02 03 04 05 14 15 23               connected=False isolated=1 : (d): complement of K0 has edges [01 12 13 24 25 34 35 45] = in T: true twin of a graph that is [in K (clique-sum of complete graphs and cycles)]; true twins 0
