See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
10 cards from this deck
A graph drawable on a plane without edges crossing
Cycle visiting every vertex exactly once, returning to start
Contains subgraph homeomorphic to K5K_5K5 or K3,3K_{3,3}K3,3
Complete graph on 5 vertices
Complete bipartite graph with two sets of 3 vertices
v−e+f=2v - e + f = 2v−e+f=2
Number of vertices
Number of edges
Number of faces (including outer face)
10 edges
Select your subjects, and get access to A+ resources today.