← Quiz: Graph Theory Workshop: all 14 questions
Quiz: Graph Theory Workshop · Question 1 of 14
Which degree sequence is graphical (some simple graph has it)?
Which degree sequence is graphical (some simple graph has it)?
- A.3, 3, 3, 1
- B.4, 4, 3, 1, 1
- C.3, 3, 2, 2, 2
- D.5, 2, 2, 1
Answer & explanation
Correct answer: 3, 3, 2, 2, 2
Havel–Hakimi reduces 3 3 2 2 2 to all zeros. 3 3 3 1 gets stuck at 2 2 0, 4 4 3 1 1 has an odd sum, and 5 is too large for 4 vertices.
Can you get the rest right without peeking?
Take the timed Quiz: Graph Theory Workshop quiz free. Pass it to earn XP and count towards your certificate.
Start the quiz →