See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
Path visiting every edge exactly once
Circuit, every edge once, starts & ends at same vertex
Number of edges connected to it
All vertices even order & graph connected
Exactly 2 vertices odd order & graph connected
Disconnected OR more than 2 odd vertices
Starts at one odd vertex, ends at other odd vertex
Contributes 2 to the vertex's order
Graph must be connected
Semi-Eulerian (if connected)
Select your subjects, and get access to A+ resources today.