See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 questions from this quiz
All vertices have even degree
Exactly 2
An Eulerian circuit
A path visiting every vertex once only
A Hamiltonian path starting & ending same
Eulerian focuses on edges, Hamiltonian on vertices
Careful inspection - no simple rule exists
Rubbish collection travelling every road
All the edges of the graph
Vertices may be visited more than once
Select your subjects, and get access to A+ resources today.