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