← Quiz: Graph Theory Workshop: all 14 questions
Quiz: Graph Theory Workshop · Question 13 of 14
A graph on 6 vertices has deg(u) + deg(v) ≥ 6 for every pair of non-adjacent vertices. What does Ore's theorem guarante…
A graph on 6 vertices has deg(u) + deg(v) ≥ 6 for every pair of non-adjacent vertices. What does Ore's theorem guarantee?
- A.An Euler circuit
- B.A Hamiltonian cycle
- C.That the graph is planar
- D.That the graph is bipartite
Answer & explanation
Correct answer: A Hamiltonian cycle
Ore's condition is sufficient for a Hamiltonian cycle (but not necessary).
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 →