🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← All topics

Quiz: Graph Theory Workshop: questions with answers

14 questions, each with the answer and a short explanation.

Take the timed quiz + get a certificate →
  1. Q1. Which degree sequence is graphical (some simple graph has it)?
  2. Q2. What does this print? (code)
  3. Q3. In the house figure, the Euler path must start at:
  4. Q4. What is the time complexity of Hierholzer's algorithm?
  5. Q5. A graph fails Dirac's condition. What can you conclude?
  6. Q6. Which statement about the Petersen graph is true?
  7. Q7. Why is K3,3 not planar?
  8. Q8. A connected planar graph has 8 vertices and 12 edges. How many faces does any planar drawing have?
  9. Q9. A connected simple graph has 6 vertices and 11 edges. Which conclusion is correct?
  10. Q10. In the complement of a simple graph on 7 vertices, what degree does a vertex of degree 2 get?
  11. Q11. What does this print? (code)
  12. Q12. 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?
  13. Q13. A graph on 6 vertices has deg(u) + deg(v) ≥ 6 for every pair of non-adjacent vertices. What does Ore's theorem guarantee?
  14. Q14. A simple planar graph with no triangles has 10 vertices. At most how many edges can it have?