n=6: graphs NOT covered by Theorem D but obtained as star multiples of yes-graphs (Prop. 4.8): 0
n=7: graphs NOT covered by Theorem D but obtained as star multiples of yes-graphs (Prop. 4.8): 7
all Euler characteristic checks chi(multiple) = k*chi passed
