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 using every edge exactly once, diff. start/end vertices
Path using every edge exactly once, same start/end vertex
Connected graph with exactly 2 odd-degree vertices
Connected graph where all vertices have even degree
Path visiting every vertex exactly once
Hamiltonian path that returns to starting vertex
Edges - every edge must be used exactly once
Vertices - every vertex must be visited exactly once
Use vertex degree rules (count odd-degree vertices)
No simple rule - must inspect graph carefully
Select your subjects, and get access to A+ resources today.