n=1: non-join graphs 1, covered by Theorem D 1 (chordal: 1); connected non-join: 1, covered 1
n=2: non-join graphs 1, covered by Theorem D 1 (chordal: 1); connected non-join: 0, covered 0
n=3: non-join graphs 2, covered by Theorem D 2 (chordal: 2); connected non-join: 0, covered 0
n=4: non-join graphs 6, covered by Theorem D 6 (chordal: 6); connected non-join: 1, covered 1
n=5: non-join graphs 21, covered by Theorem D 21 (chordal: 17); connected non-join: 8, covered 8
n=6: non-join graphs 112, covered by Theorem D 93 (chordal: 67); connected non-join: 68, covered 49
n=7: non-join graphs 853, covered by Theorem D 477 (chordal: 299); connected non-join: 662, covered 305
