🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Quiz: Graph Theory Workshop: all 14 questions

Quiz: Graph Theory Workshop · Question 12 of 14

A connected graph has exactly 4 vertices of odd degree. What is the smallest number of separate pen strokes needed to d…

A connected graph has exactly 4 vertices of odd degree. What is the smallest number of separate pen strokes needed to draw every edge once?

  1. A.1
  2. B.2
  3. C.3
  4. D.4
Answer & explanation

Correct answer: 2

Each stroke can start and end at two odd vertices, so 4 odd vertices need 4 / 2 = 2 strokes.

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 →