A graph has a degree sequence (3,3,2,2,2)(3, 3, 2, 2, 2)(3,3,2,2,2). Is this sequence graphical?
Yes, by the Havel-Hakimi algorithm.
No, the sum of degrees is odd.
No, there are too many vertices with degree 2.
Yes, because the number of vertices is odd.